Original Question:
Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],…] (s i < e i), 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
test case 1: [[0, 30],[5, 10],[15, 20]]
test case 2: [[7,10],[2,4]]
For these small test cases, the algorithm worked. Needs to check other people’s code tomorrow and compare it with mine.
