maxSubArray - time O(n^3)

function maxSubArray(nums) {
    // time - O(n^3), memory - O(1)
    let max = nums[0];
    for (let i = 0; i <= nums.length; i++) {
         for(let j = 0; j <= i; j++) {
             if (i === j) continue;
             const newMax = nums.slice(j, i).reduce((a, b) => a += b, 0);
             max = max > newMax ? max : newMax;
         }
     }
     return max;
    }