# Find All Good Strings: Walkthrough
Find All Good Strings shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Count length-n strings lexicographically between s1 and s2 that do not contain evil as a substring. Digit-style DP on position + KMP automaton state of evil + tight-low + tight-high, mod 1e9+7.
## 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 * |evil|).
## Common mistake
Forgetting the KMP failure links on a mismatch, so evil can sneak through.
## 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 learn more.