EasyVery High Frequency20 min
Two Sum & Complement Pattern
Use a HashMap to find pairs, complements, and reduce O(n²) brute force to O(n).
For any "find pair summing to target" problem: store seen values in a HashMap. For each x, check if target-x was seen. O(n) time, O(n) space.