#539Medium· asked at 17 companies
Find minimum in Rotated Sorted Array
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: nums = [3,4,5,1,2] Output: 1
The original array [1,2,3,4,5] was rotated 3 times.
Example 2
Input: nums = [4,5,6,7,0,1,2] Output: 0
Example 3
Input: nums = [11,13,15,17] Output: 11
Constraints
- •
n == nums.length - •
1 <= n <= 5000 - •
-5000 <= nums[i] <= 5000 - •
All the integers of
numsare unique.