# Number Of Unique Good Subsequences: Study Guide
Number Of Unique Good Subsequences shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DP: end0 / end1 count unique good subsequences ending in 0 / 1. A new 1 combines existing goods plus a fresh '1'; a new 0 must not double-count leading-zero sequences. Add 1 if a lone '0' exists.
## 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(n).
## Common mistake
Counting all subsequences without uniqueness, or treating leading zeros as distinct goods.
## 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 best AI tool for coding tests and OAs.