Answer: Spotify OA Question 2024 May | Two Pointers | on-campus

Solution: Two Sum II — Two Pointer Technique Approach Since the array is already sorted, we can leverage a Two Pointer approach instead of using a HashMap (which would cost O(N) space). We place one pointer at the start and one at the end: If numbers[left] + numbers[right] == target, we found our answer. If the sum is too large, move the right pointer left to decrease the sum. If the sum is too small, move the left pointer right ...