Leetcode, Interval, Interview Questions, Google, Meta.
time of the last interval in stack then skip I, else if it greater then, we need to find the earliest interval in the stack for which the end time is equal or greater than I_start. This can be done by either binary search on the end time on intervals in the stack since the end times are in sorted