# Interval Scheduling Greedy By End Time: Walkthrough
Interval Scheduling Greedy By End Time shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Sort by end time and take each interval that starts after the last chosen end.
## 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
Sorting by start time, which fails on a long early interval.
## 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 https://linkjob.ai.