Heap
Practice Heap problems
Heaps (priority queues) maintain the minimum or maximum element accessible in O(1) time with O(log n) insertions and deletions. These problems cover top-k elements, merge-k-sorted-lists, median finding with two heaps, and task scheduling with deadlines.
Practice 5 interactive coding problems with step-by-step execution visualization.
Practice Heap problems