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
You have `n` jobs given by parallel arrays `startTime`, `endTime`, and `profit`. Job i runs during the half-open interval [startTime[i], endTime[i]) and yields `profit[i]`. Return the maximum total profit you can get from a subset of non-overlapping jobs.
Example
startTime = [1,2,3,3], endTime = [3,4,5,6], profit = [50,10,40,70] → 120
Constraints
1 ≤ n ≤ 5 × 10⁴ · 1 ≤ startTime[i] < endTime[i] ≤ 10⁹ · 1 ≤ profit[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.