Start Learning

Heap / Priority Queue

Practice Heap / Priority Queue problems for coding interviews.

0/4

completed

Kth Largest Element in a Stream

Easy O(N log K)

Find Median from Data Stream

Hard O(log N)

Medium O(T * N)

Top K Frequent Words

Medium O(N log K)