Find the contiguous subarray with the largest sum (Kadane's algorithm). Variant **#45**.
Example 1
Input: nums = [0,1,2,3,-3,-2,-1,0,1,2,3,-3,-2,-1]
Output: 6
Constraints
Acceptance: 59% · Topics: array, dynamic-programming
← All practice problems