beingsde
Sign In
Back to all DSA patterns
Binary Search•Pattern: Binary Search•Medium

Find minimum in rotated sorted array

Problem Intuition & Objective

Locate the minimum element in a rotated sorted array in O(log n).

Time ComplexityO(log n)
Optimal
Space ComplexityO(1)
Memory Bounds
Optimal Algorithmic Approach

Binary search comparing mid to right boundary to detect rotation.

Core Invariants & Edge Cases

  • The minimum is the inflection point where nums[mid] > nums[right]
  • If nums[mid] < nums[right]: minimum is in [left, mid]
  • Continue binary search until left == right
Previous ProblemSearch in rotated sorted arrayNext Problem Koko eating bananas — find minimum eating speed

System Design & Architecture Roadmap

Coding interviews are only 50% of the bar. Master High-Level Design, distributed systems, and Object-Oriented LLD.

60+ HLD QuestionsSharding, caching, and real-time distributed systems.27 LLD BlueprintsObject-oriented design patterns with class diagrams.SDE Quick ReferenceLatency numbers and database selection matrix.