Problems > Merged Interval Count > Editorial

Merged Interval Count — Solution & Editorial

Back to the Problem

Sort by start; sweep keeping the current block's end. A new block starts when the next interval begins strictly after it.

Complexity: O(N log N)

Watch out: Touching intervals ([1,2] and [2,3]) merge — use a > end, not a ≥ end, to start a new block.