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