From bafd3a50bf3677360505c207fa0d747f172fab6c Mon Sep 17 00:00:00 2001
From: Amul Rathore <71003626+amul-code@users.noreply.github.com>
Date: Wed, 5 Oct 2022 23:35:40 +0530
Subject: [PATCH] 115. Distinct Subsequences

Time Complexity: O(mn) -  32ms(runtime)
---
 115_Distinct_Subsequences.py | 12 ++++++++++++
 1 file changed, 12 insertions(+)
 create mode 100644 115_Distinct_Subsequences.py

diff --git a/115_Distinct_Subsequences.py b/115_Distinct_Subsequences.py
new file mode 100644
index 0000000..94f7121
--- /dev/null
+++ b/115_Distinct_Subsequences.py
@@ -0,0 +1,12 @@
+class Solution:
+    def numDistinct(self, s, t):
+        dp = [[0] * (len(s) + 1) for _ in range(len(t) + 1)]
+        for col in range(len(dp[0])):
+            dp[0][col] = 1
+        for x in range(1, len(s) + 1):
+            for y in range(1, len(t) + 1):
+                if s[x - 1] == t[y - 1]:
+                    dp[y][x] = dp[y - 1][x - 1] + dp[y][x - 1]
+                else:
+                    dp[y][x] = dp[y][x - 1]
+        return dp[-1][-1]