← Questions
Meeting rooms: find conflicts and the minimum rooms needed
0
I was asked this
No reports yet. Sign in to say where you were asked it.
You get room requests as half-open intervals [start, end). First decide whether a single room can serve all of them (no two overlap). If not, return the fewest rooms needed so every request is met. Sort by start time and keep a min-heap of end times, or sweep over start and end events.
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
