+20 XP Reward
Maximum Subarray (Kadane)
Solved
DSA
•50% Acceptance Rate•18,750 SubmissionsGiven an integer array nums, find the subarray with the largest sum, and return its sum.
Constraints:
1 <= nums.length <= 10^5
-10^4 <= nums[i] <= 10^4
Related Topics:
Array
Dynamic Programming
Divide and Conquer
Console Output
Click "Run Test Cases" to test with public inputs or "Submit Solution" to run full evaluation suite.