Skip to interview prep
Apexed

33. Maximum Subarray

MediumDynamic programming

Return the largest sum of any contiguous, non-empty subarray of nums.

Example 1

Input: nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6
Explanation: [4, -1, 2, 1]

Example 2

Input: nums = [-3, -1, -2]
Output: -1

Constraints

  • 1 ≤ nums.length ≤ 10⁵

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Run checks these cases; the expected output comes from the reference solution. Submit judges all 4 hidden and sample tests.

Code runs only in your browser in an isolated sandbox. Progress and submissions are saved on this device.

Maximum Subarray — coding interview practice — Apexed