dsa2 min read
Meeting Rooms II
Find minimum conference rooms required by tracking room end times with a min-heap of ongoing meeting endings.
Read →
webcoderspeed.com
3 articles
Find minimum conference rooms required by tracking room end times with a min-heap of ongoing meeting endings.
Assign tasks to available servers using two heaps: one for free servers and one for busy servers sorted by free time.
Find the minimum intervals to complete all tasks given cooldown n. Greedy with max-heap: always execute most frequent available task, idle only when forced.