Algorithm Atlas

Preparing your learning space

Loading your lessons and saved progress.

Learn Heap with visual DSA lessons

Learn Heap with 5 DSA patterns and 20 visual lessons. Follow step-by-step animations and synced C#, Python, and Java code.

A heap keeps its highest- or lowest-priority value at the root.

Top-K Elements

Maintain a heap of only the K strongest candidates.

K Frequent Words Medium · Priority-queue movement
Sort characters by frequency Medium · Priority-queue movement
Kth Largest Element in an Array Medium · Priority-queue movement
Top K Frequent Elements Medium · Priority-queue movement
Minimum Cost to Connect Ropes Medium · Priority-queue movement
Find Median from Data Stream Hard · Priority-queue movement

Merge K Sorted

Compare the current front of every sorted source in one min-heap.

Find K Pairs with Smallest Sums Medium · Priority-queue movement
Merge K Sorted Lists Hard · Priority-queue movement
Smallest Range Covering Elements from K Lists Hard · Priority-queue movement

Heap with Sliding Window

Keep window priorities and lazily remove entries that are no longer inside.

Task Scheduler Medium · Priority-queue movement
Sliding Window Maximum Hard · Priority-queue movement
Sliding Window Median Hard · Priority-queue movement

Implementation of Heap

Restore parent-child priority after every insertion or removal.

Implement priority queue Easy · Priority-queue movement
Implement min heap Medium · Priority-queue movement
Implement max heap Medium · Priority-queue movement

Huffman pattern

Repeatedly combine the two smallest available values.

Minimum Cost to Connect Sticks Easy · Priority-queue movement
Minimum Cost of Ropes Medium · Priority-queue movement
Merge Files with Minimum Cost Medium · Priority-queue movement
Combine Cards / Numbers with Minimum Cost Medium · Priority-queue movement
Reorganize String Medium · Priority-queue movement