Practice Maximum Subarray
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an integer array nums, find the subarray with the largest sum, and return its sum. Follow up: If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
Source: Maximum Subarray on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [-2,1,-3,4,-1,2,1,-5,4]
Output
6
# Example 2
Input
nums = [1]
Output
1
# Example 3
Input
nums = [5,4,-1,7,8]
Output
23
Constraints
1 <= nums.length <= 10^5
-10^4 <= nums[i] <= 10^4
Related LeetCode Problems
Practice more problems similar to Maximum Subarray.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.