Leetcode 154. Find Minimum in Rotated Sorted Array II
Given a sorted array that has been rotated and may contain duplicates, find its minimum element — typically by using a modified binary search to locate the rotation point, though duplicates can invalidate comparisons and degrade worst-case runtime to O(n).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.