Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 40
Which technique merges overlapping intervals in O(n log n)?
A
Binary search each interval
B
Use a hash map of endpoints
C
Dynamic programming over all pairs
D
Sort by start, then sweep, extending the current interval while the next starts before it ends