Heaps / priority queues
Pull the smallest or largest item quickly: top-k, streaming medians, and greedy scheduling.
Solved
0/7
1Kth Largest Element in a Streammin-heap · top kEasy2Last Stone Weightmax-heap · simulationEasy3Kth Largest Element in an Arraymin-heap · top k · quickselectMedium4K Closest Points to Originmax-heap · top kMedium5Find K Pairs with Smallest Sumsmin-heap · k-way mergeMedium6Reorganize Stringmax-heap · greedyMedium7Find Median from Data Streamtwo heaps · designHard