Greedy¶
| Problem | Complexity | Key Pattern |
|---|---|---|
| Interval Scheduling | O(n log n) |
Activity selection / resource booking — "max non-overlapping intervals", |
| Jump Game | O(n) |
Reachability analysis — "can you reach the end?", "minimum hops to |
| Merge Intervals | O(n log n) |
Overlapping range consolidation — "merge intervals", "insert interval", |