D. J.:

- Added the leetcode problem and solution for 10

Author: nobodyPerfecZ

README.md

@@ -73,6 +73,7 @@
 - [7 Reverse Integer](https://leetcode.com/problems/reverse-integer/description/)
 - [8 String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/description/)
 - [9 Palindrome Number](https://leetcode.com/problems/palindrome-number/description/)
+- [10 Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/description/)
 - [11 Container With Most Water](https://leetcode.com/problems/container-with-most-water/description/)
 - [12 Integer to Roman](https://leetcode.com/problems/integer-to-roman/description/)
 - [13 Roman to Integer](https://leetcode.com/problems/roman-to-integer/description/)

awesome_python_leetcode/_10_regular_expression_matching.py

@@ -0,0 +1,34 @@
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def isMatch(self, s: str, p: str) -> bool:
+        """
+        Given an input string s and a pattern p, implement regular expression matching
+        with support for '.' and '*' where:
+        - '.' Matches any single characters.
+        - '*' Matches zero or more of the preceding element.
+
+        The matching should cover the entire input string (not partial).
+        """
+        # Time Complexity: O(n²)
+        # Space Complexity: O(n²)
+        dp = {}
+
+        def dfs(i: int, j: int) -> bool:
+            if i >= len(s) and j >= len(p):
+                return True
+            if j >= len(p):
+                return False
+            if (i, j) in dp:
+                return dp[(i, j)]
+            match = i < len(s) and (s[i] == p[j] or p[j] == ".")
+            if (j + 1) < len(p) and p[j + 1] == "*":
+                dp[(i, j)] = dfs(i, j + 2) or (match and dfs(i + 1, j))
+                return dp[(i, j)]
+            if match:
+                dp[(i, j)] = dfs(i + 1, j + 1)
+                return dp[(i, j)]
+            dp[(i, j)] = False
+            return False
+
+        return dfs(0, 0)

tests/test_10_regular_expression_matching.py

@@ -0,0 +1,20 @@
+import pytest
+
+from awesome_python_leetcode._10_regular_expression_matching import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["s", "p", "expected"],
+    argvalues=[
+        ("aa", "a", False),
+        ("aa", "a*", True),
+        ("ab", ".*", True),
+        ("aab", "c*a*b", True),
+        ("ab", ".*c", False),
+        ("a", "ab*", True),
+    ],
+)
+def test_func(s: str, p: str, expected: bool):
+    """Tests the solution of a LeetCode problem."""
+    is_match = Solution().isMatch(s, p)
+    assert is_match is expected