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