All problems
#101

Distinct Subsequences

HardDynamic Programming

Solve the classic problem: "Distinct Subsequences". This is a hard Dynamic Programming problem commonly asked in placement interviews at top tech companies. Read the examples carefully and think about edge cases before coding your solution.

Examples

Input: Example input goes here
Output: Expected output
Walk through the logic step by step.
Input: Second test case
Output: Another expected output
class Solution:
    def distinctSubsequences(self):
        # Write your solution here
        pass
Output
Run your code to see output here.