Patterns
MI · Pattern 04
Merge Intervals
Sort intervals by start time, then greedily merge overlapping ones. The key insight: if sorted, you only ever need to compare with the last merged interval.
- Time
- O(n log n)
- Space
- O(n)
Spot it when
- Overlapping intervals problem
- Scheduling / meeting rooms
- Insert or merge a new interval
- Find free time slots
Problems
Easy to hard · 0/5 solved