# LC6311 Merge K Sorted Lists
**Idea.** heap of list heads.
**How I'd explain it in an interview**
- Restate the problem and confirm input sizes
- Give the brute force, then the key observation: heap of list heads
- Code it, then dry-run a small example
- Finish with time/space complexity and edge cases
*Disclosure: I work on [Linkjob AI](https://www.linkjob.ai/) — a tool for practicing coding interviews. These are my own study notes.*