Given a sorted array that has been rotated between 1 and n times, find the minimum element in O(log n) time.
Input: nums = [3,4,5,1,2] Output: 1 Input: nums = [4,5,6,7,0,1,2] Output: 0
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features