All Patterns
Pattern 4
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)
Recognize it when
- Overlapping intervals problem
- Scheduling / meeting rooms
- Insert or merge a new interval
- Find free time slots
Progress0/5
0 solved0 attempted
Questions — ordered by difficulty
#56Medium
Merge Intervals
Given an array of intervals, merge all overlapping intervals.
arraysortingmerge-intervals
#57Medium
Insert Interval
Insert a new interval into a sorted non-overlapping list and merge if necessary.
arraymerge-intervals
#252Easy
Meeting Rooms
Given an array of meeting time intervals, determine if a person can attend all meetings.
arraysortingmerge-intervals
#253Medium
Meeting Rooms II
Find the minimum number of conference rooms required to hold all meetings.
arrayheapsorting
#435Medium
Non-overlapping Intervals
Find the minimum number of intervals you need to remove to make the rest non-overlapping.
arraysortinggreedy