DSA sheet · Topic
Heap / Priority Queue interview problems
Always knowing the smallest or largest item: top-k questions, scheduling, and running medians.
- 5 problems
- Java + Python
- Free, no sign-up
09 Heap / Priority Queue Always knowing the smallest or largest item: top-k questions, scheduling, and running medians. 0 / 5
- 80 Last Stone Weight Easy Has notes Practice Last Stone Weight on LeetCode (opens in a new tab)
- 81 Kth Largest Element in an Array Medium Has notes Practice Kth Largest Element in an Array on LeetCode (opens in a new tab)
- 82 K Closest Points to Origin Medium Has notes Practice K Closest Points to Origin on LeetCode (opens in a new tab)
- 83 Task Scheduler Medium Has notes Practice Task Scheduler on LeetCode (opens in a new tab)
- 84 Find Median from Data Stream Hard Has notes Practice Find Median from Data Stream on LeetCode (opens in a new tab)
No problems match these filters.