LeetCodeDistinct Subsequences
Dynamic Programming
Asked at 10 companies
3 recent
- Amazon
- Microsoft
- Meta
- Swiggy
- Meesho
- Salesforce
- Coupang
- Zoho
- Bloomberg
Community-reported · source · updated 2026-10-08. ● asked in the last 6 months.
Go step by step: try it yourself before the video and the visual. Progress saves on this device.
0 / 160 pointsSolved (Hard) 0/70Reviews 0/50Mastered 0/25Practice steps 0/15
Step 1
Know these before you start
Practise each one here, or tick what you already know
Concept videoBuilds on: Recursion: the base case and the call stack
Step 2
Try it on paper
5–10 minutes, no code yet
In the wild · Spell check and diff: “Did you mean…?” compares words with edit distance, and diff tools align two files with longest common subsequence. Both fill a DP table.
About this problem
Break a problem into overlapping subproblems and reuse their answers.
Read the full statement and examples on LeetCode, try it for 20–30 minutes, then come back for the walkthrough.
Examples
Full statement on LeetCode ↗Example 1
- Input
- s = "rabbbit"t = "rabbit"
- Output
- 3
Example 2
Single character- Input
- s = "aaa"t = "a"
- Output
- 3
Example 3
- Input
- s = "abc"t = "abcd"
- Output
- 0
Code it here
Tab indents · ⌘/Ctrl+Enter runs · Esc leaves the editor
Step 6
Get it accepted
All test cases pass
Step 7
Review it so it sticks
Re-solve from memory after
The step that matters most: without reviews most of a solved problem fades within weeks. Three short re-solves, each just as you start to forget, are what make it yours.
Your notes
Three lines in your own words. They come back with this problem's reviews, so you can check yourself after recalling the solution.
Solve it yourself before you look
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: optimal solution
Solution code
Optimal solutiondp[j] counts the ways to form the first j letters of t from what you've read of s. Reading a letter of s that equals t[j − 1] adds the ways to form the first j − 1. Go through j backwards so each letter of s is used once per count.
class Solution:
def numDistinct(self, s: str, t: str) -> int:
ways = [1] + [0] * len(t) # ways[0]: the empty prefix, always 1
for ch in s:
for j in range(len(t), 0, -1):
if t[j - 1] == ch:
ways[j] += ways[j - 1]
return ways[-1]Reference solution, tested in Python, Java and C++.
Other ways to solve it
- Thought of another approach (slower, or cleverer)? Code it here: the same tests check any approach.
- Community solutions on LeetCode ↗ for many more versions, in many languages. Read them after you've solved it.