You have learned the major interval patterns:
1. Merge overlapping intervals (sort by start)
2. Insert and merge (three-phase approach)
3. Find intersections (two-pointer)
4. Remove covered intervals (sort and track max)
5. Cover a range (greedy extension) In the next section, I will show you greedy problems on arrays: jump games, gas station, and more. If you learn these patterns, you will recognize interval problems instantly in interviews.