Unique triples problem

unique-triplets.js

const array = [-1, 0, 1, 2, -1, -4];
const length = array.length;
const sum = 0;
const solutions = [];

array.sort();

array.map((d, i) => {
  let j = i + 1;
  let k = length - 1;

  while (j < k) {
    if (array[i] + array[j] + array[k] === sum) {
      solutions.push([array[i], array[j], array[k]]);
      j++;
      k--;
    } else {
      j++;
    }
  }
});

console.log('solution', solutions);