She Leads Tech
Practices

// Problem: Two Sum / Two Pointers Approach
// Time Complexity: O(n) | Space Complexity: O(1)

function twoSumSorted(numbers: number[], target: number): number[] {
  let left = 0;
  let right = numbers.length - 1;

  while (left < right) {
    const sum = numbers[left] + numbers[right];

    if (sum === target) {
      return [left + 1, right + 1]; // Found match!
    } else if (sum < target) {
      left++; // Need a larger value
    } else {
      right--; // Need a smaller value
    }
  }

  return [];
}