Question
You run a single-server batch system. Each job is given as [deadline, profit], takes exactly one time unit, and earns its profit only if it finishes at or before its integer deadline (slots are 1..deadline). At most one job can occupy a time slot. Return the maximum total profit achievable by choosing a feasible subset and an order. Deadlines and profits are positive; the list may be empty.
job_scheduling_profit(jobs: list[list[int]]) → int[[[4,70],[1,80],[1,30],[1,20]]]out150State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.