1. You are given N number of intervals, where each interval contains two integers denoting the start time and the end time for the interval. The task is to merge all the overlapping intervals and return the list of merged intervals sorted by increasing order of their start time.
Two intervals [A,B] and [C,D] are said to be overlapping with each other if there is at least one integer that is covered by both of them.
Input Format:
The first line of input contains an integer N, the number of intervals.
The second line of input contains N integers, i.e. all the start times of the N intervals.
The third line of input contains N integers, i.e. all the end times of the N intervals.
Output Format:
Print the final list of merged intervals
Sample Input 1:
5
1 3 6 8 10
4 5 8 9 12
Sample Output 1:
1 5
6 9
10 12
Explanation:
For the given 5 intervals - [1, 4], [3, 5], [6, 8], [8, 9], [10, 12]
Since intervals [1, 4] and [3, 5] overlap with each other, we will merge them into a single interval as [1, 5].
Similarly, [6, 8] and [8, 9] overlap, merge them into [6,9].
Interval [10, 12] does not overlap with any interval.
Final List after merging overlapping intervals: [1, 5], [6, 9], [10, 12].
PREFERED LANGUAGE IS JAVA