Question

Kadane Algorithm

by cmruser

JavaScript

// Q. Find the subarray with the maximum sum.

const array = [-2,-3,4,-1,-2,1,5,-1];

let result = array[0];
let current = array[0];

for(var i = 1; i < array.length - 1; i++) {
	
}