---
title: "Evelyn Liu (@evelynliu) | Hashnode"
description: "Evelyn Liu (@evelynliu) writes on Hashnode. Read their latest articles and follow their work."
url: "https://hashnode.com/@evelynliu"
---

@evelynliu

# Evelyn Liu

@evelynliu · Joined December 2023

[Website](https://www.evelynliu.com/)

### [Day 49 of LeetCode](https://evelynsjourney.hashnode.dev/day-49-of-leetcode?utm_source=hashnode&utm_medium=feed)

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

1 min read · [evelynsjourney.hashnode.dev](https://evelynsjourney.hashnode.dev/day-49-of-leetcode?utm_source=hashnode&utm_medium=feed)

[Apr 1, 2024](https://hashnode.com/posts/day-49-of-leetcode/660ae1be4b2bf5eafda7e34f)

### [Day 48 of LeetCode](https://evelynsjourney.hashnode.dev/day-48-of-leetcode?utm_source=hashnode&utm_medium=feed)

Documenting LeetCode solving. Q125 312. Burst Balloons Hard. DP Reverse thinking. class Solution: def maxCoins(self, nums: List\[int\]) -> int: nums = \[1\] + nums + \[1\] dp = {} def dfs(l, r): if l > r: ...

1 min read · [evelynsjourney.hashnode.dev](https://evelynsjourney.hashnode.dev/day-48-of-leetcode?utm_source=hashnode&utm_medium=feed)

[Mar 29, 2024](https://hashnode.com/posts/day-48-of-leetcode/660717f979a601b74117c776)

### [Day 47 of LeetCode](https://evelynsjourney.hashnode.dev/day-47-of-leetcode?utm_source=hashnode&utm_medium=feed)

Documenting LeetCode solving. Q123 115. Distinct Subsequences Hard. DP class Solution: def numDistinct(self, s: str, t: str) -> int: dp = {} def dfs(i, j): if j == len(t): return 1 if i == ...

1 min read · [evelynsjourney.hashnode.dev](https://evelynsjourney.hashnode.dev/day-47-of-leetcode?utm_source=hashnode&utm_medium=feed)

[Mar 26, 2024](https://hashnode.com/posts/day-47-of-leetcode/66030027a40d749e8001d471)

### [Day 46 of LeetCode](https://evelynsjourney.hashnode.dev/day-46-of-leetcode?utm_source=hashnode&utm_medium=feed)

Documenting LeetCode solving. Q121 97. Interleaving String Medium. 2D DP. class Solution: def isInterleave(self, s1: str, s2: str, s3: str) -> bool: if len(s1) + len(s2) != len(s3): return False dp = \[\[False\] \* (len(s...

2 min read · [evelynsjourney.hashnode.dev](https://evelynsjourney.hashnode.dev/day-46-of-leetcode?utm_source=hashnode&utm_medium=feed)

[Mar 25, 2024](https://hashnode.com/posts/day-46-of-leetcode/6601a99d4d2bad105d294f05)

### [Day 45 of LeetCode](https://evelynsjourney.hashnode.dev/day-45-of-leetcode?utm_source=hashnode&utm_medium=feed)

Documenting LeetCode solving. Q120 494. Target Sum Medium. DP class Solution: def findTargetSumWays(self, nums: List\[int\], target: int) -> int: dp = {} # (index, total) -> number of ways def backtrack(i, total): if i ...

1 min read · [evelynsjourney.hashnode.dev](https://evelynsjourney.hashnode.dev/day-45-of-leetcode?utm_source=hashnode&utm_medium=feed)

[Mar 22, 2024](https://hashnode.com/posts/day-45-of-leetcode/65fdc420c9343a27175552eb)
