Merge Intervals

Function Name: mergeIntervals

Description

Given a collection of intervals, each represented as a pair of integers, write a function 'mergeIntervals' that merges all overlapping intervals. The function should return an array of intervals where overlapping intervals are merged into single intervals that span from the smallest to the largest numbers included in any of the overlapping intervals.

Intervals are represented as an array/pair of two integers, for example, [1, 3]. An interval [a, b] is considered to overlap with [c, d] if there's any number x such that a <= x <= b and c <= x <= d.

The returned intervals should be in ascending order of their start values. Assume that the input list is unsorted.

Requirements

• The function should take a single parameter - an array of interval pairs.
• The function should return a sorted array of non-overlapping intervals.
• If the intervals overlap, merge them into a single interval.
• Intervals will be represented as arrays with two integers [start, end].
• All the integers in the intervals will be positive integers.
• The function should handle an empty array input and return an empty array.

Examples

Function Call: mergeIntervals([[1,3], [2,6], [8,10], [15,18]])Output: [[1,6], [8,10], [15,18]]Explanation: Since intervals [1,3] and [2,6] overlap, they are merged into [1,6].Function Call: mergeIntervals([[6,8], [1,9], [2,4], [4,7]])Output: [[1,9]]Explanation: All the provided intervals overlap, resulting in a single merged interval [1,9].

Links