Given a SORTED array of integers, return all unique triplets that sum to zero. Brute force is O(n³) but the expected solution is O(n²).

Press 1–4 to pick. Time pressure is the point — go with your gut.