Meeting Rooms II

Medium

ArrayTwo PointersGreedySortingHeap

Given an array of meeting time intervals `intervals` where `intervals[i] = [start_i, end_i]`, return the **minimum number of conference rooms** required. **Example 1:** ``` Input: intervals = [[0,30],[5,10],[15,20]] Output: 2 ``` **Example 2:** ``` Input: intervals = [[7,10],[2,4]] Output: 1 ```

Expected Time Complexity

O(n log n)

Expected Space Complexity

O(n)

Example Test Cases

Example 1

Input:

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

Output:

Example 2

Input:

[[7,10],[2,4]]

Output:

Problem List

Progress0 / 0

No problems found.