The decompose-sort-sweep pattern you used for meeting rooms is not specific to meetings. It works for any problem that asks: what is the maximum number of overlapping intervals at any point?

WiFi coverage areas. Flight arrivals/departures. Server request durations. Traffic density.

Same three steps: decompose each interval into +1/-1 events, sort by time, sweep with a counter. The peak counter is the answer.

Six access points with overlapping ranges. Find the position with the strongest combined signal.

Take the classic LC56 merge dataset. This time, sweep it instead of merging. The counter answers both questions: where do merged groups end (counter hits 0) and what is the peak concurrency (max counter value).