Merge Overlapping Intervals

Problem

Given intervals intervals where each interval is [l, r] with l <= r, merge all overlapping intervals and output the merged list sorted by start.

Input (stdin)

  • Line 1: integer `n...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: