D. J.:

- Added the leetcode problem and solution for 35 and 74

Author: nobodyPerfecZ

README.md

@@ -15,7 +15,7 @@
             <img src="https://img.shields.io/badge/tests-passed-brightgreen">
         </a>
         <a>
-            <img src="https://img.shields.io/badge/coverage-97%25-brightgreen">
+            <img src="https://img.shields.io/badge/coverage-98%25-brightgreen">
         </a>
     </h1>
 </div>
@@ -45,6 +45,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 - [27 Remove Element](https://leetcode.com/problems/remove-element/description/)
 - [28 Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/description/)
 - [30 Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/description/)
+- [35 Search Insert Position](https://leetcode.com/problems/search-insert-position/description/)
 - [36 Valid Sudoku](https://leetcode.com/problems/valid-sudoku/description/)
 - [39 Combination Sum](https://leetcode.com/problems/combination-sum/description/)
 - [42 Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/description/)
@@ -67,6 +68,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 - [69 Sqrt(x)](https://leetcode.com/problems/sqrtx/description/)
 - [71 Simplify Path](https://leetcode.com/problems/simplify-path/description/)
 - [73 Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/description/)
+- [74 Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/description/)
 - [76 Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/description/)
 - [77 Combinations](https://leetcode.com/problems/combinations/description/)
 - [79 Word Search](https://leetcode.com/problems/word-search/description/)

awesome_python_leetcode/_35_search_insert_position.py

@@ -0,0 +1,24 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def searchInsert(self, nums: List[int], target: int) -> int:
+        """
+        Given a sorted array of distinct integers and a target value, return the index
+        if the target is found. If not, return the index where it would be if it were
+        inserted in order.
+
+        You must write an algorithm with O(log n) runtime complexity.
+        """
+        left, right = 0, len(nums) - 1
+        while left <= right:
+            mid = (right + left) // 2
+            if nums[mid] < target:
+                left = mid + 1
+            elif nums[mid] > target:
+                right = mid - 1
+            else:
+                return mid
+        return left

awesome_python_leetcode/_74_search_a_2d_matrix.py

@@ -0,0 +1,30 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
+        """
+        You are given an m x n integer matrix matrix with the following two properties:
+        - Each row is sorted in non-decreasing order.
+        - The first integer of each row is greater than the last integer of the previous
+        row.
+
+        Given an integer target, return true if target is in matrix or false otherwise.
+
+        You must write a solution in O(log(m * n)) time complexity.
+        """
+        rows, cols = len(matrix), len(matrix[0])
+        left, right = 0, (rows * cols) - 1
+        while left <= right:
+            mid = (right + left) // 2
+            row = mid // cols
+            col = mid % cols
+            if matrix[row][col] < target:
+                left = mid + 1
+            elif matrix[row][col] > target:
+                right = mid - 1
+            else:
+                return True
+        return False

tests/test_35_search_insert_position.py

@@ -0,0 +1,19 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._35_search_insert_position import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "target", "expected"],
+    argvalues=[
+        ([1, 3, 5, 6], 5, 2),
+        ([1, 3, 5, 6], 2, 1),
+        ([1, 3, 5, 6], 7, 4),
+    ],
+)
+def test_func(nums: List[int], target: int, expected: int):
+    """Tests the solution of a LeetCode problem."""
+    idx = Solution().searchInsert(nums, target)
+    assert idx == expected

tests/test_74_search_a_2d_matrix.py

@@ -0,0 +1,18 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._74_search_a_2d_matrix import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["matrix", "target", "expected"],
+    argvalues=[
+        ([[1, 3, 5, 7], [10, 11, 16, 20], [23, 30, 34, 60]], 3, True),
+        ([[1, 3, 5, 7], [10, 11, 16, 20], [23, 30, 34, 60]], 13, False),
+    ],
+)
+def test_func(matrix: List[List[int]], target: int, expected: bool):
+    """Tests the solution of a LeetCode problem."""
+    actual = Solution().searchMatrix(matrix, target)
+    assert actual is expected