# Letter Tile Possibilities: Explained
Letter Tile Possibilities shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Count the nonempty sequences you can build from letter tiles (duplicates allowed as in the multiset). Backtrack on the frequency map: pick any letter that still has count > 0, decrement, recurse, increment; every partial path is a valid sequence.
## 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(sum k!) bounded by the 7-tile constraint.
## Common mistake
Treating identical tiles as distinct (overcount) or only counting permutations of the full set.
## 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 here.