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).
Asked at:
Goldman Sachs
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Late April, 2026
Goldman Sachs
Mid-level
Minimum and Maximum Element in an rotated sorted array containing duplicates.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.