Home
Related Problems
Merge Intervals
Medium
Intervals
•
Grind 75
NeetCode 150
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
Constraints:
1 <= intervals.length <= 104
intervals[i].length == 2
0 <= starti <= endi <= 104
Show Test Cases
Show Solution