Meeting Rooms II
Difficulty: Medium
Category: DSA
Topics: Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
Asked at: Amazon, Bloomberg, Facebook, Google, Microsoft, Oracle, Uber, Yandex, ByteDance, Twitter, Apple, Walmart Labs, Adobe, Expedia, eBay
You are given an array of meeting time intervals `intervals` where `intervals[i] = [starti, endi]` represents the start and end times of the `i`th meeting. All meetings are scheduled in the same building, and a meeting can use any available conference room.
Your task is to determine the **minimum number of conference rooms required** so that all meetings can take place without any overlaps (i.e., no two meetings are scheduled in the same room at the same time).
Return _the minimum number of conference rooms required_.
**Constraints:**
- `1 <= intervals.length <= 10^4`
- `0 <= starti < endi <= 10^6`