Evelyn Liuevelynsjourney.hashnode.dev·Mar 26, 2024Day 47 of LeetCodeDocumenting 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 == ...30+20 days of LeetCode leetcodeAdd a thoughtful commentNo comments yetBe the first to start the conversation.