# Maximum Profit In Job Scheduling: Interview Notes
Maximum Profit In Job Scheduling shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Sort jobs by end time. DP[i] = max(DP[i-1], profit[i] + DP[prev]) where prev is the rightmost job that ends <= start[i] (binary search). Same structure as weighted interval scheduling.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n log n).
## Common mistake
A greedy take-earliest or take-highest-profit scan, which is optimal only for the unweighted version.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob AI copilot.