The Busiest Moment — Solution & Editorial

Back to the Problem

Sweep events: +1 at a, −1 at b+1 (inclusive end). Sort events and track the running count's maximum.

Complexity: O(N log N)

Watch out: Endpoints are inclusive: a guest leaving at time b still counts at b, so the −1 event belongs at b+1.