# LC6322 Top K Frequent Words
**Idea.** bucket sort or heap with tie-break.
**How I'd explain it in an interview**
- Restate the problem and confirm input sizes
- Give the brute force, then the key observation: bucket sort or heap with tie-break
- Code it, then dry-run a small example
- Finish with time/space complexity and edge cases
*Disclosure: I work on [AI interview assistant](https://www.linkjob.ai/) — a tool for practicing coding interviews. These are my own study notes.*