Section 1Understand Problem
Section 01
Understand the problem
Restate the problem precisely. Interviewers reward candidates who pause, define the contract, and name the guarantees before coding.
Problem statement
Given an integer array `nums`, find the contiguous non-empty subarray that has the largest sum, and return that sum.
Example
nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4] → 6
Constraints
1 ≤ nums.length ≤ 10⁵ · −10⁴ ≤ nums[i] ≤ 10⁴
Audio recording unsupported on this browser.
WPM—Fillers0Pace—Thinking0%
Explain the problem in your own words
0 words0 chars
AI Review
Write your thinking above first.
Once you've drafted a response, click Submit for AI review and a senior engineer will critique your reasoning.
Ready to submit Section 1?
The reviewer will check whether you stated inputs, output, guarantees, and any assumption you flagged.
Write at least a couple of sentences explaining the problem before submitting.