You have learned the major interval patterns:
Merge overlapping intervals (sort by start)
Insert and merge (three-phase approach)
Find intersections (two-pointer)
Remove covered intervals (sort and track max)
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.