Using The Two Pointer Technique (Main Thread)

let arr = [1, 2, 3, 4, 5];
let target = 7;

function two_sum(arr, target) {
  let n = 0;
  let k = 1;
  let pointerOne = arr[n];
  let pointerTwo = arr[arr.length - k];
  console.log(pointerOne, pointerTwo);
  let finalArray = [];

  while (n

Team AlgoDaily Commented on Jan 11, 2021:

Hey Rudy,

It's because of these lines:

let n = 0;
let k = 1;

and while (n <= k) {

I believe you intended to set k to be the last index of the input array. But because it was set to 1, we evaluated while (0 <= 1), and thus only one iteration was done. If k was instead arr.length - 1 (5 - 1 or 4), you'd evaluate while (0 <= 4) and have several more iterations to move the two pointers.

Rudy Commented on Jan 11, 2021:

Thanks Jake, yup you were right, I needed to update k to arr.length. I also updated my incrementing and decrementing counters from n and k to pointerOne and pointerTwo.

Here is the code below for those curious:

SNIPPET

let arr = [1, 2, 3, 4, 5];
let target = 7;

function two_sum(arr, target) {
  let n = 0;
  let k = arr.length - 1;
  let pointerOne = arr[n];
  let pointerTwo = arr[k];
  let finalArray = [];

  while (n