Cod
Vector
Sheets
Dashboard
Sign In
Back
Maximum Subarray
Medium
Description
Hints (2)
Submissions
Array
Divide and Conquer
Dynamic Programming
Given an integer array `nums`, find the subarray with the largest sum, and return *its sum*.
Example 1
Input:
nums = [-2,1,-3,4,-1,2,1,-5,4]
Output:
6
Explanation: The subarray [4,-1,2,1] has the largest sum 6.
Example 2
Input:
nums = [1]
Output:
1
Example 3
Input:
nums = [5,4,-1,7,8]
Output:
23
Constraints
•
1 <= nums.length <= 10⁵
•
-10⁴ <= nums[i] <= 10⁴
Time Complexity
O(n)
Space Complexity
O(1)
A−
14
A+
Test Cases
Result
Custom Input
Run
Submit
Case 1
Input:
[-2,1,-3,4,-1,2,1,-5,4]
Expected:
6
Case 2
Input:
[1]
Expected:
1
Case 3
Input:
[5,4,-1,7,8]
Expected:
23