Find Minimum in Rotated Sorted Array — Medium Coding Interview Question

Suppose an array of length n sorted in ascending order is rotated between 1 and n times. Given the sorted rotated array nums of unique elements, return the minimum element of this array. You must write an algorithm that runs in O(log n) time.

Example

Input: nums = [3,4,5,1,2]

Output: 1

Constraints

• n == nums.length
• 1 ≤ n ≤ 5000
• -5000 ≤ nums[i] ≤ 5000
• All integers in nums are unique.

Topics & Companies

Topics: binary-search, arrays

Asked by: Google, Amazon, Meta, Microsoft

Optimal Solution Complexity

Time complexity: O(log n). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns