largestSubarraySum(array)

index.js

function largestSubarraySum(array) {
    let currentSum = 0
    let largestSum = 0

    function getCurrentSum(currentSum, currentNumber) {
        let sum = currentNumber + currentSum
        if (sum > 0) {
            currentSum = sum
        }
        if (sum <= 0) {
            currentSum = 0
        }
        return currentSum
    }

    for (let n of array) {
        // console.log('BEF', currentSum)
        currentSum = getCurrentSum(currentSum, n)
        // console.log('AFTER', currentSum)

        if (currentSum > largestSum) {
            largestSum = currentSum
        }   
    }

    return largestSum
}