CodingMediumcod-g591

Subject HeapsLevel Mid–Senior~25 minCommon in Algorithms & data structures interviewsIndustries Software development, Technology

Question

Given a list of meeting intervals as [start, end] pairs (end exclusive), return the minimum number of conference rooms required so that no two overlapping meetings share a room. Intervals may be unsorted and may share endpoints (a meeting ending at time t and another starting at t can share a room). 0 <= number of meetings <= 10^4.

Implement

min_meeting_rooms(intervals: list[list[int]]) → int

Examples

in[[[0,30],[5,10],[15,20]]]out2

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.