🐰 Evelyn's Learning Journey
Day 49 of LeetCode

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)] ...

Evelyn Liu
Evelyn Liu
1 min read
Day 48 of LeetCode

Day 48 of LeetCode

Evelyn Liu
Evelyn Liu
1 min read
Day 47 of LeetCode

Day 47 of LeetCode

Evelyn Liu
Evelyn Liu
1 min read
Day 46 of LeetCode

Day 46 of LeetCode

Evelyn Liu
2 min read
Day 45 of LeetCode

Day 45 of LeetCode

Evelyn Liu
1 min read
Day 44 of LeetCode

Day 44 of LeetCode

Evelyn Liu
1 min read
Day 43 of LeetCode

Day 43 of LeetCode

Evelyn Liu
2 min read
Day 42 of LeetCode

Day 42 of LeetCode

Evelyn Liu
1 min read
Day 41 of LeetCode

Day 41 of LeetCode

Evelyn Liu
2 min read
Day 40 of LeetCode

Day 40 of LeetCode

Evelyn Liu
2 min read
Day 39 of LeetCode

Day 39 of LeetCode

Evelyn Liu
2 min read
Day 38 of LeetCode

Day 38 of LeetCode

Evelyn Liu
2 min read