Maximum Subarray — Medium Coding Interview Question

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

Example

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.

Constraints

• 1 ≤ nums.length ≤ 10⁵
• -10⁴ ≤ nums[i] ≤ 10⁴

Topics & Companies

Topics: arrays, dp

Asked by: Amazon, Google, Meta, Microsoft, Apple, Adobe, Bloomberg

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns