Find Minimum in Rotated Sorted Array

Binary Search, problem 5 of 7

Find Minimum in Rotated Sorted Array

Medium

LC #153

binary searchrotated array

Not attempted yet

A sorted array of distinct integers was rotated some number of times (possibly zero): for example [0,1,2,4,5,6,7] may have become [4,5,6,7,0,1,2].

Given the rotated array nums, return its minimum value in O(log n) time.

Example 1

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

Example 2

Input: nums = [4,5,6,7,0,1,2]
Output: 0

Example 3

Input: nums = [11,13,15,17]
Output: 11
Explanation: not rotated at all.

Constraints

  • 1 <= nums.length <= 10^5
  • -5000 <= nums[i] <= 10^5
  • All values are distinct.

Python

Loading draft…

Test results

9 tests available

No results yet

Run tests your code against the examples; Submit runs the hidden tests too.

3 examples, 6 hidden

Run examples, then submit all tests.