Problem Statement
Given a sorted array and a target, find two numbers that add up to target.
Approach
Use two pointers at start and end. If sum < target, move left pointer right. If sum > target, move right pointer left.
Time & Space Complexity
Time O(n), Space O(1).
