Binary Search

Binary search halves a sorted range at every step until one value is left. The harder part is noticing when a problem hides a sorted order you can search over, like the slowest eating speed in Koko Eating Bananas or the largest minimum gap in Magnetic Force Between Two Balls.

The four chapters go from searching a sorted array, to binary search on the answer, to ternary search on functions with a single peak, and end with mixed problems. Take it after the sliding window plan, or on its own if binary search on the answer still feels like guesswork.