Given an integer n, return any array containing n unique integers such that they add up to 0.

sumZero.js

/**
 * @param {number} n
 * @return {number[]}
 */
var sumZero = function(n) {
    const result = [];

    // Add symmetric pairs: [-1, 1], [-2, 2], ...
    for (let i = 1; i <= Math.floor(n / 2); i++) {
        result.push(-i, i)
    }

    // If n is odd, include 0 to balance the sum
    if (n % 2 !== 0) {
        result.push(0);
    }

    return result;
};