Meeting Rooms II
Find minimum number of meeting rooms required using heap
Merge Intervals
Given an array of intervals where intervals[i] = [start_i, end_i], merge all overlapping intervals and return an array of the non-overlapping intervals that cover all the intervals in the input.
Minimum Number of Platforms
Given arrival and departure times of trains at a station, find the minimum number of platforms required so that no train is kept waiting