← Questions
Meeting rooms with delayed starts: the busiest room
0
I was asked this
No reports yet. Sign in to say where you were asked it.
There are n rooms numbered from 0 and a list of meetings with distinct start times. Each meeting takes the free room with the lowest number; if none is free, it waits for the earliest room to free up and keeps its original duration. Return the room that held the most meetings (lowest number on ties). Simulate with two heaps.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding