140. Find Minimum in Rotated Sorted Array II

HardBinary Search

Given the sorted rotated array nums that may contain duplicates, return the minimum element of this array. You must decrease the overall operation steps as much as possible.

Examples

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

Output: 1

Explanation: Public test case for Find Minimum in Rotated Sorted Array II

Constraints

  • n == nums.length
  • 1 <= n <= 5000
  • -5000 <= nums[i] <= 5000
  • nums is sorted and rotated between 1 and n times.
Loading...

Run checks all cases above. Submit evaluates all test cases.