FastPrep
Problem · Array

Merge Intervals

Learn this problem
● MediumSeekOut logoSeekOutONSITE INTERVIEW

Problem statement

Given a collection of closed intervals [start, end], merge every pair that overlaps or touches and return the resulting non-overlapping intervals sorted by start.

Function

merge(intervals: int[][]) → int[][]

Examples

Example 1

intervals = [[1,3],[2,6],[8,10],[15,18]]return = [[1,6],[8,10],[15,18]]

Example 2

intervals = [[1,4],[4,5]]return = [[1,5]]
drafts saved locally
public int[][] merge(int[][] intervals) {
  // write your code here
}
intervals[[1,3],[2,6],[8,10],[15,18]]
expected[[1,6],[8,10],[15,18]]
checking account