Heap practice problems

A focused problem list tied to the real-world applications on this topic. Open any problem directly on its platform.

4 problems List view Mobile optimized

Why this page exists

The main topic page explains where the idea is used in production. This child page is only for practice.

Heap practice

4 items

Kth Largest Element in an Array

Direct max/min heap usage for ranked extraction.

Top K Frequent Elements

Frequency counting plus heap selection of top candidates.

Find Median from Data Stream

Classic two-heap design for balanced streaming statistics.

Task Scheduler

Scheduling problem where greedy ordering and heap management combine.