Meeting Rooms II Problem

Meeting Rooms II Problem — ExecCode Medium DSA Practice

Solve the Meeting Rooms II problem on ExecCode. Free online medium DSA practice in Intervals. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Given an array of meeting time intervals where intervals[i] = [starti, endi], return the minimum number of conference rooms required so that no two meetings that overlap in time share the same room.

Examples

Input intervals = [[0, 30], [5, 10], [15, 20]]; Output 2. Input intervals = [[7, 10], [2, 4]]; Output 1. Input intervals = [[1, 10], [2, 7], [3, 19], [8, 12]]; Output 3

Constraints

1 ≤ intervals.length ≤ 10⁴ 0 ≤ starti < endi ≤ 10⁶

Practice Meeting Rooms II free on ExecCode. Browse DSA problems, topic map, and placement guides.