Back to problems

Meeting Rooms / Interval Scheduling Variants

Algorithm · Google · Medium

Requirements The central problem family starts with a collection of intervals (start, end)—or equivalent pairs such as pickup and return times, meeting windows, or server execution periods. Depending on the variant, determine one or more of the following: Minimum capacity: find the fewest rooms, cars, or servers that can accommodate every interval concurrently, as in the classic minimum-meeting-rooms problem. Assignment: identify the room or other resource allocated to each…

Checking your access…