4Sum LeetCode solution in JavaScript

1
var fourSum = function (nums, target) {
2
  nums.sort((a, b) => a - b);
3
  const res = [];
4

5
  for (let i = 0; i < nums.length - 3; i++) {
6
    for (let j = i + 1; j < nums.length - 2; j++) {
7
      let min = j + 1;
8
      let max = nums.length - 1;
9
      while (min < max) {
10
        const sum = nums[i] + nums[j] + nums[min] + nums[max];
11
        if (sum === target) {
12
          res.push([nums[min], nums[max], nums[i], nums[j]]);
13
          while (nums[min] === nums[min + 1]) min++;
14
          while (nums[max] === nums[max - 1]) max--;
15
          min++;
16
          max--;
17
        } else if (sum > target) max--;
18
        else min++;
19
      }
20
      while (nums[j] === nums[j + 1]) j++;
21
    }
22
    while (nums[i] === nums[i + 1]) i++;
23
  }
24

25
  return res;
26
};