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