Leetcode, Interval, Interview Questions, Google, Meta.
order too in the stack, or popping intervals from the stack till we find one. Popping intervals from stack is advantageous as in, if the intervals were given to us already sorted, then we can accomplish it in O(N) time complexity. Time complexity is O(N*logN). Problem 4: Given A and B two interval