# Distinct Subsequences II: Walkthrough
Distinct Subsequences II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Track how many distinct subsequences end with each letter. A new letter c sets end[c] = sum(end) + 1, which removes duplicates automatically.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(26 n).
## Common mistake
Doubling the count each step without subtracting what the last occurrence of the letter already produced.
## 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 the Linkjob AI app.