253. Meeting Rooms II

-
https://leetcode.com/problems/meeting-rooms-ii/

Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), find the minimum number of conference rooms required.

Example 1:

Input: [[0, 30],[5, 10],[15, 20]]
Output: 2

Example 2:

Input: [[7,10],[2,4]]
Output: 1
---
Intuition
Need to count the max number of overlaps
Wrapper class - int time, boolean isStart

Sort by time, if time is same => need to release the room first => Boolean.compare(a.isStart, b.isStart)
Iterate through the sorted list of wrapper class
    if start
        rooms++
    else
        room--

    ans= max(ans, rooms)
---
Time - O(N log N)
Space - O(N)
---
Related problems
---