Maximum Subarray

maxSubarray.js

/**
 * @param {number[]} nums
 * @return {number}
 */
var maxSubArray = function(nums) {
    let sum = 0;
    let maxSum = nums[0];
    for(let i = 0; i < nums.length; i++) {
        sum += nums[i];
        if(sum > maxSum) maxSum = sum;
        if(sum < 0) sum = 0;
    }

    return maxSum;
};

// Kadane's Algorithm
// Start adding from first element, if at any point the sum goes below 0, then assume the next element is the first element
// and repeat till the whole array is traversed