Find the maximum subarray sum (Kadane's Problem) in an array containing negative numbers. Brute force is O(n²)/O(n³) — optimize to O(n).

Find all pairs in an array that sum to a target value (return all valid pairs). Brute force is O(n²) — optimize to O(n).