111 Merge Intervals Medium Sort + Merge

Given a list of time ranges that may overlap, combine any overlapping ranges into single ranges.

O(n log n) time · O(n) space
112 Insert Interval Medium Linear Scan

Insert a new time range into an already-sorted list of non-overlapping ranges, merging any overlaps.

O(n) time · O(n) space
113 Non-overlapping Intervals Medium Greedy End-Sort

Remove the fewest time ranges so that none of the remaining ones overlap.

O(n log n) time · O(1) space
114 Meeting Rooms Easy Sort + Check

Check if any meetings in your schedule overlap with each other.

O(n log n) time · O(1) space
115 Meeting Rooms II Medium Min Heap

Figure out the fewest meeting rooms needed so every meeting has a room, even when meetings overlap.

O(n log n) time · O(n) space
116 Minimum Interval to Include Each Query Hard Sort + Heap

For each query value, find the smallest interval (by length) that contains it.

O((n+q) log n) time · O(n+q) space