Identify

Motive

Problems

Base / Corner Cases

Steps

Complexity

Time Complexity
Operations Worst case
Sorting O(n log n)
Scan O(n)
Heap usage O(n log n)
Merging O(n log n)
Space Complexity
Worst case
Arrays O(n)

n is the number of intervals