Coding - Meeting Rooms II

Problem Statement

Given an array of meeting time intervals where intervals[i] = [start_i, end_i], and each start_i < end_i, find the minimum number of meeting rooms required to accommodate all meetings.

Example 1:

Input: intervals = [[0,30],[5,10],[15,20]] Output: 2

Example 2:

Input: intervals = [[7,10],[2,4]] Output: 1

Constraints:

• 0 <= intervals.length <= 104
• 0 <= start_i < end_i <= 106

Note: intervals[i] are in non-decreasing order by their start time. The intervals are already sorted based on the start time. If a meeting has the same start time, the meeting with the longer duration comes first.

Hints

1. Sort the intervals based on their end times.
2. Use a greedy approach to allocate rooms.
3. Use a priority queue to keep track of the end times of the meetings currently in the rooms.