kadaneAlgorithm.js

/*
Given an array containing both negative and positive integers. Find the contiguous sub-array with maximum sum.
 
Input:
The first line of input contains an integer T denoting the number of test cases. The description of T test cases follows. The first line of each test case contains a single integer N denoting the size of array. The second line contains N space-separated integers A1, A2, ..., AN denoting the elements of the array.
 
Output:
Print the maximum sum of the contiguous sub-array in a separate line for each test case.
 
Constraints:
1 ≤ T ≤ 200
1 ≤ N ≤ 1000
-100 ≤ A[i] <= 100
 
Example:
Input
2
3
1 2 3
4
-1 -2 -3 -4
Output
6
-1
*/

const maxSum = (array) => {
    let currentMaximum
    let globalMaximum

    currentMaximum = globalMaximum =array[0]

    for(let i=0;i<array.length;i++){
        currentMaximum = Math.max(array[i], currentMaximum + array[i])
    }
    if(currentMaximum > globalMaximum)
        globalMaximum = currentMaximum
    return globalMaximum
}

const array = [-5,6,3,-2,14]
console.log(maxSum(array))