Python data engineering interview problem. Difficulty: intermediate. Pattern: Intervals. About 14 minutes. Part of the Pro drill bank.
Minimum number of meeting rooms required. Treat this as a production helper: match the contracted return shape, including empty and duplicate inputs.
Implement min_meeting_rooms(intervals: list) -> int.
Input: min_meeting_rooms([[0, 30], [5, 10], [15, 20]]) Output: 2 Peak concurrency is 2.
Topics: lakebench, python, heap, rooms.
More Python interview questions · All interview problems · Learn data engineering
Interview-style drill: Minimum number of meeting rooms required.
Implement `min_meeting_rooms(intervals: list) -> int`. Example: `[[0, 30], [5, 10], [15, 20]]` → `2`. Keep the harness.