Maximum Subarray
Updated Jan 31, 2026
Problem
Given 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.
Constraints
1 <= nums.length <= 10^5
-10^4 <= nums[i] <= 10^4
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.
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
Example 3
Input:
nums = [5,4,-1,7,8]
Output:
23
Function Signature
def maxSubArray(self, nums: list[int]) -> int
How to Submit
Implement a Solution class with a maxSubArray method.
Your method will be called with the input parameters and should return the answer.