Pattern 04 of 08 · binary-search

Binary Search & Search Space

Systematically bisect monotonic search spaces or sorted ranges to locate target values or find optimal feasibility boundaries in O(log N) time.

See the invariant

Step through it

binary-searchInteractive Sandbox

Curated visualizer for binary-search is available via Socratic AI Mentor steps and the interactive playground below.

Pattern InvariantTwo Pointers

Converging search on sorted array: Target Sum = 26

Step 1 of 3

[0]

[1]

[2]

[3]

[4]

[5]

nums[0] (2)+nums[5] (23)=25<Target (26)

Sum 25 < target (26). Since array is sorted, we MUST increase left pointer (L: 0 to 1) to seek a larger sum.

Speed:

3 problems