Leetcode, Interval, Interview Questions, Google, Meta.
drivers among those is in the interval [I_start, minimum end time ≥ I_start]. We can track the minimum end time using a min heap. While I_start > min_heap[0], continue popping the root of the min heap. Time complexity is O(N*logN). Space complexity is O(N). If we follow the approach where we