Use two pointers on a sorted array to find pairs that sum to target K in O(n) time.
β’ Sum > K: Move RIGHT inward (decrease)
β’ Sum < K: Move LEFT inward (increase)
β’ Beat the enemy before time runs out!
β’ Wrong moves let the enemy catch up!
You discovered the treasure!