Leetcode, Interval, Interview Questions, Google, Meta.
previous event must be a start event and current event must be an end event. Time complexity is O(N*logN). Space complexity is O(N). Although we are using additional space to store the events. Problem 2: Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping