Greedy: meeting rooms II

← Courses›Interview PrepModule 3 · Trees, Graphs, BFS/DFS›Greedy: meeting rooms IIwrite40 / 100

Task

📝 **Task:** Write `min_meeting_rooms(intervals)`. Print `min_meeting_rooms([[0,30],[5,10],[15,20]])`. Expected: 2

📋 Edit the starter code. Tests run automatically.

💡 **Hint:** Re-read the theory if stuck.

Keep going

🎯write

Bit manipulation: XOR & masks

🎯writeFREE

Two pointers: pair sum

🎯write

Two pointers: palindrome check

🤖predictFREE

Prerequisites — what you should know before this track

⚡predictFREE

Prerequisites — what you should know before this track

✏️ Write your code here

🐍

Loading Python...

First visit only — ~5-10s. Stays cached afterward.

📊 Result

Press Run to see result...

Keep going

💬 Discussion