Classic interview pattern: place one pointer at each end of a sorted array. The sum (or difference) tells you which pointer to move — every step discards a chunk of impossible pairs.
Sorted ascending numbers. Question: is there a pair that sums to target?