Search lands in PR-5.1 (Pagefind).

Data Structures & Algorithms

Scheduling with Heap

Priority-queue-driven interval scheduling — most-booked-room and reschedulable tasks.

  1. Problem 01 Meeting Rooms III — Most Booked Room Two heaps: available rooms by index, busy rooms by end time. 6 min
  2. Problem 02 Task Scheduler Frame the most frequent task; fill gaps. Closed-form: (max_f − 1) × (n + 1) + ties. 5 min