Merge Intervals
medium⏱ 15 mintypescriptchallengesproblem-solving-intermediate-
Caso de ejemplo — tu programa lee de stdin e imprime en stdout.
Given an array of intervals where intervals[i] = [start, end], merge all overlapping intervals and return non-overlapping intervals.
Algorithm: Sort by start time, then iterate and merge if current start ≤ previous end.
Example: [[1,3],[2,6],[8,10],[15,18]] → [[1,6],[8,10],[15,18]] (intervals [1,3] and [2,6] overlap)
Formato de entrada
Line 1: n (number of intervals). Next n lines: start end (space-separated).
Formato de salida
Merged intervals, one per line as 'start end'.
Restricciones
1 ≤ n ≤ 10⁴, 0 ≤ start ≤ end ≤ 10⁴