Kadane’s algorithm

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

A subarray is a contiguous part of an array.

Example 1:

Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

Example 2:

Input: nums = [1]
Output: 1

Example 3:

Input: nums = [5,4,-1,7,8]
Output: 23

Explanation

var nums = [-2,-1,55]
var largestsum = -667676767676767
var current= 0

for(var i = 0 ; i<nums.length; i++){
current = current + nums[i]
largestsum = Math.max(largestsum,current)
if (current <0){
current = 0
}

}

console.log(largestsum)