D. J.:

- Added the leetcode problem and solution for 57 Insert Interval

Author: nobodyPerfecZ

README.md

@@ -31,6 +31,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 - [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/)
+- [57 Insert Interval](https://leetcode.com/problems/insert-interval/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/_57_insert_interval.py

@@ -0,0 +1,42 @@
+from typing import List
+
+
+class Solution:
+    def insert(
+        self,
+        intervals: List[List[int]],
+        newInterval: List[int],
+    ) -> List[List[int]]:
+        """
+        You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi]
+        represent the start and the end of the ith interval and intervals is sorted in ascending order by starti.
+        You are also given an interval newInterval = [start, end] that represents the start and end of another interval.
+
+        Insert newInterval into intervals such that intervals is still sorted in ascending order by starti and
+        intervals still does not have any overlapping intervals (merge overlapping intervals if necessary).
+
+        Return intervals after the insertion.
+
+        Note that you don't need to modify intervals in-place. You can make a new array and return it.
+        """
+        output = []
+        i = 0
+
+        # Add all intervals that come before newInterval
+        while i < len(intervals) and intervals[i][1] < newInterval[0]:
+            output.append(intervals[i])
+            i += 1
+
+        # Merge overlapping intervals
+        while i < len(intervals) and intervals[i][0] <= newInterval[1]:
+            newInterval[0] = min(newInterval[0], intervals[i][0])
+            newInterval[1] = max(newInterval[1], intervals[i][1])
+            i += 1
+        output.append(newInterval)
+
+        # Add remaining intervals
+        while i < len(intervals):
+            output.append(intervals[i])
+            i += 1
+
+        return output

tests/test_57_insert_interval.py

@@ -0,0 +1,25 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._57_insert_interval import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["intervals", "newInterval", "expected"],
+    argvalues=[
+        ([[1, 3], [6, 9]], [2, 5], [[1, 5], [6, 9]]),
+        (
+            [[1, 2], [3, 5], [6, 7], [8, 10], [12, 16]],
+            [4, 8],
+            [[1, 2], [3, 10], [12, 16]],
+        ),
+    ],
+)
+def test_func(
+    intervals: List[List[int]],
+    newInterval: List[int],
+    expected: List[List[int]],
+):
+    inserted_intervals = Solution().insert(intervals, newInterval)
+    assert inserted_intervals == expected