One Meeting Room — Solution & Editorial

Back to the Problem

Sort by start and check every adjacent pair: the next start must be ≥ the previous end.

Complexity: O(N log N)