Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

medium· binary-search Mock interview

Find Minimum in Rotated Sorted Array

A sorted-ascending array of distinct integers `nums` has been rotated some number of times. Return its minimum element in O(log n).

Examples

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

out: 1

rotated at index 3

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

out: 0

min is 0

Constraints

1 <= len(nums) <= 5000
distinct values

Hints

target: O(log n) time⌘↩ run · ⇧⌘↩ submit