Maximum Subarray
MEDIUMArrays StringsGiven an integer array nums, find the subarray with the largest sum, and return its sum.
A subarray is a contiguous non-empty sequence of elements within an array.
Examples
Example 1
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
The subarray [4,-1,2,1] has the largest sum 6.
Example 2
Input: nums = [1]
Output: 1
The subarray [1] has the largest sum 1.
Example 3
Input: nums = [5,4,-1,7,8]
Output: 23
The subarray [5,4,-1,7,8] has the largest sum 23.
Constraints
- 1 <= nums.length <= 10^5
- -10^4 <= nums[i] <= 10^4
Select Mode
Solo Practice
Solve on your own with test feedback. Ask Sophia for hints when stuck.
Coach Me (Sophia)
Sophia guides you through the problem step-by-step.
Mock Interview with Sophia
Simulate a real interview with Sophia as your interviewer.