# Leetcode - Merge Intervals Solution

Given an array of `intervals`

where `intervals[i] = [start`

, merge all overlapping intervals, and return _{i}, end_{i}]*an array of the non-overlapping intervals that cover all the intervals in the input*.

**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.
```

### Solution in Python3

```
class Solution:
def merge(self, intervals: List[List[int]]) -> List[List[int]]:
intervals.sort()
solution = []
for i in intervals:
if not solution or i[0] > solution[-1][1]:
solution.append(i)
else:
solution[-1][1] = max(i[1], solution[-1][1])
return solution
```