Algorithm · Google · Medium
Given a list of meeting intervals, with each interval written as [start, end], create an algorithm that finds the fewest conference rooms needed to schedule every meeting without any meetings in the same room colliding. Implement the following function and include test cases: Test Cases: Input: [[2, 18], [6, 9], [11, 16]] Output: 2 Input: [[12, 15], [3, 8]] Output: 1 Input: [[4, 9], [28, 33], [20, 28], [9, 20]] Output: 1 Example
Checking your access…