Runtime: 9 ms (Top 61.84%) | Memory: 42.7 MB (Top 63.49%)

Author: AnasImloul

scripts/algorithms/D/Distinct Subsequences II/Distinct Subsequences II.java

@@ -1,3 +1,4 @@
+// Runtime: 9 ms (Top 61.84%) | Memory: 42.7 MB (Top 63.49%)
 class Solution {
         public int distinctSubseqII(String s) {
             int mod = (int)1e9+7;
@@ -25,4 +26,4 @@ public int distinctSubseqII(String s) {
             //Doing -1 because we don't have to count the empty string.
             return dp[n]-1;
         }
-    }
+    }