# Distinct Subsequences: Study Guide
Distinct Subsequences shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DP[i][j] = ways to form the first j letters of t from the first i of s; add dp[i-1][j-1] when the letters match.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (string DP, sliding window, trie, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(nm) time, O(m) space.
## Common mistake
Using LCS length instead of counting every matching subsequence.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI coding interview assistant.