The Meeting Room Allocator

A hard Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

hard

Seniority

L5

Problem

Given meetings as a list of [start, end] intervals, return the minimum number of rooms needed so no two meetings in the same room overlap. Intervals are half-open [start, end): a meeting ending at t does not conflict with one starting at t.

Summary

Meetings overlap on the calendar. Rooms are limited.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.