โ† All coding problems

Maximum subarray sum

MediumDynamic programming

Return the largest sum of any non-empty contiguous subarray of nums (Kadane's algorithm).

Function
function solve(nums)
Example 1
nums = [-2,1,-3,4,-1,2,1,-5,4]
โ†’ 6

Submit also runs 3 hidden tests, including edge cases.

console.log output is shown below