A simple Three Number Sum Algorithm implementation

threeNumSumAlgo.js

// using the pointer method the three number algorithm is solved
let threeSumArray = (array, targetSum) => {
  array.sort((a, b) => a - b);
  const triplet = []
  for (let i = 0; i < array.length - 2; i++) {
   // initialize the pointers
    let left = i + 1
    let right = array.length - 1
    while (left < right) {
      let currentSum = array[i] + array[left] + array[right]
      if(currentSum === targetSum) {
        triplet.push([array[i], array[left], array[right]])
        left++
        right--
      } else if(currentSum < targetSum) {
        left++
      } else {
        right--
      }
    }
  }
  return triplet
}

let arrays = [2, 1, 4, 3, 7, 5, 9, 6, 8, 15]
let targetSum = 18
threeSumArray(arrays, targetSum)