# Heap Pattern Checklist - Top-k problems: keep a heap of size k. - Merging k sorted lists: push the head of each list. - Python heapq is a min-heap; negate for max. **Practice tip.** Say the key idea in one sentence before you dive into details, then check it against a concrete example. *Disclosure: prep note shared by the Linkjob AI team.* For live mock-interview practice see [Linkjob AI](https://www.linkjob.ai/).