##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Minimum rooms needed
Given an array of meeting intervals, find the minimum number of conference rooms required. Example: needs 2 rooms.
At time 5, meetings and overlap. You're solving the maximum overlap count problem. At any point in time, how many intervals are active? Constraints: up to meetings.
