The Pair Finding Problem

New problem: given a sorted array, find two numbers that sum to a target. Brute force: check all pairs. That's $O(n^2)$. There's a technique that solves this in $O(n)$ with no extra space. It's called two pointers, and it's one of the most useful patterns in competitive programming.