Gamified challenge · Sorting by start
meetings[i] = [start, end] is a meeting from minute start up to minute end, with start < end. Two meetings clash if they overlap in time; a meeting that ends at minute t frees its room for one starting at t.
Write minRooms(meetings) (Python min_rooms(meetings)) that returns the fewest rooms that let every meeting run at its time without sharing. No meetings need 0 rooms.
Example: [[0, 30], [5, 10], [15, 20]] → 2: one room for [0, 30), and [5, 10) and [15, 20) take turns in a second.
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google