Problem Statement
Given an array of intervals where intervals[i] = [start_i, end_i], merge all overlapping intervals and return an array of non-overlapping intervals.
Approach
Sort intervals by start. Iterate and merge if current overlaps with previous.
Complexity Analysis
| Metric | Value |
|---|---|
| Time | O(n log n) |
| Space | O(n) |
Examples
Example 1
Input: intervals = [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: [1,3] and [2,6] overlap
Example 2
Input: intervals = [[1,4],[4,5]]
Output: [[1,5]]
Explanation: [1,4] and [4,5] overlap
Constraints
- ▸
1 <= intervals.length <= 10^4 - ▸
intervals[i].length == 2 - ▸
0 <= start_i <= end_i <= 10^4
Loading...
Sign in to run your code...
Asked by companies:
FacebookGoogleAmazonMicrosoft