Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 10
How many meeting rooms are needed for a set of intervals?
A
Sort by start; keep a min-heap of end times; reuse a room if the earliest end ≤ current start; the heap's max size is the answer
B
Count distinct start times
C
Count intervals
D
Find the longest interval