Solution: Merge Intervals
Let's solve the Merge Intervals problem using the Merge Intervals pattern.
Statement
We are given an array of intervals
, where each interval has a start time and an end time. The input array is sorted with respect to the start times of each interval. For example, intervals
= is sorted in terms of start times , and .
Your task is to merge the
Constraints:
-
intervals.length
intervals[i].length
- start time end time
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.