Day 49 of LeetCode
Documenting LeetCode solving.
Q126
10. Regular Expression Matching
Hard. DP
class Solution:
def isMatch(self, s: str, p: str) -> bool:
dp = {}
def dfs(i, j):
if (i, j) in dp:
return dp[(i, j)]
...
evelynsjourney.hashnode.dev1 min read