Least You Need to Know: Interval Overlap, Meeting Rooms, and End-Time Heaps
เปิดบทเรียน
Some interval problems are not about choosing one compatible subset. Instead they ask for the maximum number of overlapping intervals at any moment, or equivalently the minimum number of rooms needed to host them all. A min-heap of end times tracks how many intervals are active right now.