Opening page…
Pull the smallest or largest item quickly: top-k, streaming medians, and greedy scheduling.
Solved
| Solved | # | Problem | Pattern | Level | Preview |
|---|---|---|---|---|---|
| 1 | Kth Largest Element in a Stream | min-heap · top k | Easy | ||
| 2 | Last Stone Weight | max-heap · simulation | Easy | ||
| 3 | Kth Largest Element in an Array | min-heap · top k · quickselect | Medium | ||
| 4 | K Closest Points to Origin | max-heap · top k | Medium | ||
| 5 | Find K Pairs with Smallest Sums | min-heap · k-way merge | Medium | ||
| 6 | Reorganize String | max-heap · greedy | Medium | ||
| 7 | Find Median from Data Stream | two heaps · design | Hard |
Showing 1–7 of 7 problems