# Blogs Hub

### by Sumit Chourasia | Oct 30, 2020 | Category :coding | Tags : algorithmarraydata-structureleetcodemedium #### Merge Intervals - Array - Medium - LeetCode

Given a collection of intervals, merge all overlapping intervals.

Example 1:

Input: intervals = [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].
Example 2:

Input: intervals = [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are considered overlapping.
NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

Constraints:

intervals[i] <= intervals[i]

``````public class Solution {
public int[][] Merge(int[][] intervals) {
if(intervals.Length==0){
return intervals;
}
Array.Sort(intervals, (a, b) => { return a - b; });
var res = new List<int[]>();
int start = intervals;
int end = intervals;

for(int i=1;i<intervals.Length;i++){
if(end>=intervals[i] && end <= intervals[i]){
end = intervals[i];
}
else if(end < intervals[i]){
start = intervals[i];
end = intervals[i];
}
}