FastPrep
Problem Β· Intervals

Merge Intervals πŸ‹

● EasyAmazonINTERNNEW GRADOA
See Amazon hiring insights

AMZ Interval Collection (A group of problems focused on operations involving intervals :) -

1. Merge Intervals (Intern, NG)

2. Find Overlapping Times (Intern)

3. Get Maximum Sum Find Overlapping Times (Full-Time)

4. Task Scheduler (Full-Time)

5. Optimal Interval Difference

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.

♫⋆ｑβ™ͺΛšβ™¬ ﾟ., Credit to whale 🐳 ✢࿐

Examples
01 Β· Example 1
intervals = [[1,3],[2,6],[8,10],[15,18]]
return = [[1,6],[8,10],[15,18]]
Since intervals [1,3] and [2,6] overlap, merge them into [1,6].
02 Β· Example 2
intervals = [[1,4],[4,5]]
return = [[1,5]]
Intervals [1,4] and [4,5] are considered overlapping.
Constraints
  • 1 <= intervals.length <= 104
  • intervals[i].length == 2
  • 0 <= starti <= endi <= 104
More Amazon problems
drafts saved locally
public int[][] merge(int[][] intervals) {
  // write your code here (feel free to refer to LC56)
}
intervals[[1,3],[2,6],[8,10],[15,18]]
expected[[1,6],[8,10],[15,18]]
sign in to submit