D. J.:

- Added the leetcode problem and solution for 56 Merge Intervals

Author: nobodyPerfecZ

README.md

@@ -20,7 +20,6 @@
     </h1>
 </div>
 
-
 This repository contains awesome LeetCode problems and solutions written in Python to prepare for coding interviews.
 
 ## Leetcode Problems & Solutions 💻
@@ -31,6 +30,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 - [45 Jump Game II](https://leetcode.com/problems/jump-game-ii/description/)
 - [49 Group Anagrams](https://leetcode.com/problems/group-anagrams/description/)
 - [55 Jump Game](https://leetcode.com/problems/jump-game/description/)
+- [56 Merge Intervals](https://leetcode.com/problems/merge-intervals/description/)
 - [80 Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/description/)
 - [88 Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/description/)
 - [121 Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/)

awesome_python_leetcode/_56_merge_intervals.py

@@ -0,0 +1,19 @@
+from typing import List
+
+
+class Solution:
+    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
+        """
+        Given an array of intervals where intervals[i] = [starti, endi],
+        merge all overlapping intervals, and return an array of the
+        non-overlapping intervals that cover all the intervals in the input.
+        """
+        intervals = sorted(intervals, key=lambda i: i[0])
+        output = [intervals[0]]
+        for start, end in intervals[1:]:
+            last_end = output[-1][1]
+            if start <= last_end:
+                output[-1][1] = max(last_end, end)
+            else:
+                output.append([start, end])
+        return output

tests/test_56_merge_intervals.py

@@ -0,0 +1,17 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._56_merge_intervals import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["intervals", "expected"],
+    argvalues=[
+        ([[1, 3], [2, 6], [8, 10], [15, 18]], [[1, 6], [8, 10], [15, 18]]),
+        ([[1, 4], [4, 5]], [[1, 5]]),
+    ],
+)
+def test_func(intervals: List[List[int]], expected: List[List[int]]):
+    merged_intervals = Solution().merge(intervals)
+    assert merged_intervals == expected