Evelyn Liuevelynsjourney.hashnode.dev·Apr 1, 2024Day 49 of LeetCodeDocumenting 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)] ...30+20 days of LeetCode leetcodeAdd a thoughtful commentNo comments yetBe the first to start the conversation.