No Vacancy

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

Domain

Python

Difficulty

hard

Seniority

L5

Problem

A room-booking service holds a day's calendar as `meetings`, a list of `[start, end]` intervals, and needs the fewest rooms that can host all of them without two live meetings sharing a room. Treat the intervals as half-open: a meeting ending at `t` frees its room for one starting at `t`, and an empty schedule needs zero rooms.

Summary

Every booking needs a room. Find the busiest moment.

Practice This Problem

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