# Find Words That Can Be Formed By Characters: Explained
Find Words That Can Be Formed By Characters shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A word is good if it can be formed from chars without reuse across that word. Count chars once; a word is good when its own counts are componentwise <= the chars counts. Sum the lengths of good words.
## 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(total length).
## Common mistake
Using a single shared chars count that gets decremented across words (chars reset per word), or allowing extra letters not in chars.
## 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 Linkjob.