# Word Pattern II: Study Guide
Word Pattern II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Match a pattern onto a string with a bijection from letters to nonempty substrings. Backtrack: for the next pattern letter, either reuse its existing mapping (if the string prefix matches) or try every unused split of the remaining string. Prune when lengths cannot fit.
## 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(exponential, pruned).
## Common mistake
Treating it as Word Pattern I (space-separated tokens) or allowing two letters to map to the same substring.
## 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 interview copilot app.