Solo practice workspace

Interview Coder drill

Maximum Subarray

20:00

Medium

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

Example 1

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

Output: 6

Subarray [4,-1,2,1] has the largest sum = 6

Constraints

1 <= nums.length <= 10^5-10^4 <= nums[i] <= 10^4

Recall before you code

Capture your plan, then rate how clearly you recalled it before submitting.

What cues point to the Dynamic Programming 1D pattern?What invariant or template will you maintain?Which edge cases could break your approach?

How well did you recall the approach?

solution.py

Runs: 0 | Submissions: 0

Loading Python runtime...