Search
⌘K
Leetcode 153. Find Minimum in Rotated Sorted Array
Given an ascending array of unique integers that has been rotated, find its minimum element in O(log n) time by identifying the rotation pivot using a binary-search-like approach.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.