Sort the intervals by their start value first. Then iterate through, merging each interval into the previous one when they overlap.

Merge Intervals

hard

Acceptance: 41%

IntervalsSortingArrays

Given a list of intervals [start, end], combine every pair of intervals that overlaps into a single interval. Return the resulting list of merged intervals sorted by start value.

Examples

Example 1:

Input:intervals = [[2,4],[1,3],[7,9],[8,11]]

Output:[[1,4],[7,11]]

Example 2:

Input:intervals = [[1,5],[5,8]]

Output:[[1,8]]

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Merge Intervals

Examples

Hints

Related Problems