Dashboard
#61. Maximum SubarrayMediumGreedy

Given an integer array nums, find the subarray with the largest sum, and return its sum.

Examples
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
Explanation: The subarray [1] has the largest sum 1.
Example 3:
Input: nums = [5,4,-1,7,8]
Output: 23
Explanation: The subarray [5,4,-1,7,8] has the largest sum 23.
Constraints
  • 1 <= nums.length <= 10^5
  • -10^4 <= nums[i] <= 10^4
Company Frequency
Apple21Amazon20Google16Goldman Sachs13Microsoft12Oracle10Meta9Cisco9
Prerequisites
Target: O(N) time • O(1) spaceKadane's Algorithm
Socratic AI Tutor
Gemini 3.8 Flash
Loading editor...

Click "Run" or press Ctrl+Enter to execute test cases.