Meeting Rooms II

Given an array of meeting time intervals where each interval is represented as a pair of start and end times [[start_1, end_1], [start_2, end_2], ...] (where start_i < end_i), find the minimum number of meeting rooms required to schedule all meetings without any conflicts.

Constraints:

• The input consists of one or more intervals.
• 0 <= start_i < end_i <= 10^8

Examples:

1. Example 1:

   • Input: intervals = [[0,30],[5,10],[15,20]]
   • Output: 2
   • Explanation:
     • The first meeting is from 0 to 30.
     • The second is from 5 to 10. They are conflicts with each other.
     • The third is from 15 to 20. It doesn't conflict with the first two.
     • So you need 2 meeting rooms.

2. Example 2:

   • Input: intervals = [[7,10],[2,4]]
   • Output: 1
   • Explanation:
     • The two meetings can be scheduled in the same room.

Hints:

• Sort the intervals based on their start times.
• Use a priority queue to keep track of the end times of the meetings.
• For each interval, check if there is a room available (i.e., the smallest end time in the priority queue is less than the current meeting's start time). If so, replace it; otherwise, add a new room.

Note:

• (start_i, end_i) is not considered a conflict if end_i <= start_j for any other meeting j.