Given an array of meeting time intervals intervals
where intervals[i] = [start, end],
return the minimum number of conference rooms required.
Input: [[0,30],[5,10],[15,20]] Output: 2
Input: [[7,10],[2,4]] Output: 1
Print only the integer result.
No submissions yet.
Discuss heap-based scheduling, sorting start/end times, and interval overlap detection.
