Runtime: 1092 ms (Top 41.44%) | Memory: 70.6 MB (Top 63.39%)

Author: AnasImloul

scripts/algorithms/D/Distinct Subsequences/Distinct Subsequences.py

@@ -1,3 +1,4 @@
+# Runtime: 1092 ms (Top 41.44%) | Memory: 70.6 MB (Top 63.39%)
 class Solution:
     def numDistinct(self, s: str, t: str) -> int:
         if len(t) > len(s):
@@ -13,4 +14,4 @@ def numDistinct(self, s: str, t: str) -> int:
                 if s[j] == t[i]:
 
                     dp[i][j] += dp[i + 1][j + 1]
-        return dp[0][0]
+        return dp[0][0]