# Count Anagrams: Practice Notes
Count Anagrams shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Split the sentence on spaces. The number of distinct anagrams is the product over words of len(word)! / product(count[c]!), mod 1e9+7. Precompute factorials and modular inverses.
## 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 + 26).
## Common mistake
Treating the whole sentence as one word, or forgetting modular inverses.
## 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 AI assistant for technical interviews.