Maximum Split of Positive Even Integers LeetCode solution in JavaScript

1
var maximumEvenSplit = function (finalSum) {
2
  if (finalSum % 2) return [];
3

4
  const set = new Set();
5

6
  let n = 2,
7
    sum = 0;
8

9
  while (sum < finalSum) {
10
    sum += n;
11
    set.add(n);
12
    n += 2;
13
  }
14

15
  set.delete(sum - finalSum);
16

17
  return [...set];
18
};