Given an array of meeting time intervals, return the minimum number of conference rooms required.
Input: intervals = [[0,30],[5,10],[15,20]]
Output: 2
Topics: heap, sorting, two-pointers
Asked by: Google, Amazon, Meta
Time complexity: O(n log n). Space complexity: O(n).