Heap / Priority Queue — Practice Questions
2 free PYTHON challenges on Heap / Priority Queue, auto-graded in the browser. Each states the problem, shows the input and expected output, and explains the answer.
- Find k Smallest Elements Using a Min-Heap — Easy · PYTHON · +50 XP
- Top K Frequent Elements in a Stream — Medium · PYTHON · +100 XP