Merge overlapping intervals

Q: Merge overlapping intervals

This question evaluates understanding of interval manipulation, array processing, and algorithmic efficiency by requiring reasoning about overlapping ranges and proper handling of edge cases.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

Given an array of closed intervals intervals, where each interval is [start, end] and start <= end, merge all overlapping intervals and return an array of the merged, non-overlapping intervals sorted by start time.

Two intervals [a, b] and [c, d] overlap if c <= b (assuming a <= c).

Input

intervals : list of n intervals

Output

A list of merged intervals.

Example

Input: [[1,3],[2,6],[8,10],[15,18]]

Output: [[1,6],[8,10],[15,18]]

Constraints

1 ≤ n ≤ 10^5
Interval endpoints fit in 32-bit integers.

Merge overlapping intervals

Quick Overview

Input

Output

Example

Constraints

Comments (0)