MediumArrays
Merge Intervals
googlemetaamazonbloombergmicrosoftlinkedinuber
Given an array of intervals where intervals[i] = [start_i, end_i], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
Examples
Example 1
Input
intervals = [[1,3],[2,6],[8,10],[15,18]]
Output
[[1,6],[8,10],[15,18]]
Intervals [1,3] and [2,6] overlap, so they are merged into [1,6]. The remaining intervals do not overlap.
Example 2
Input
intervals = [[1,4],[4,5]]
Output
[[1,5]]
Intervals [1,4] and [4,5] share the endpoint 4, so they are merged into [1,5].
Example 3
Input
intervals = [[1,4],[0,4]]
Output
[[0,4]]
The two intervals overlap completely, merging into [0,4].
Constraints
- 1 <= intervals.length <= 104
- intervals[i].length == 2
- 0 <= start_i <= end_i <= 104
Optimal complexity
Time
O(n log n)
Space
O(n)
One problem, two ways to prep
Choose between solo practice and interview simulation
Practice Mode keeps things simple with code + tests. AI Interview Mode adds voice, pressure, and a post-round score summary.