#Greedy Algorithms

Given a list of meeting time intervals, find the minimum number of meeting rooms required to accommodate all meetings. Use sorting and a min-heap (priority queue) to maintain the earliest ending meeting to efficiently reuse rooms. Example: Input: intervals = [[0,30],[5,10],[15,20]] Output: 2.