Heap dan Antrean Prioritas

10 Heap dan Antrean Prioritas

Pilih kandidat terbaik dengan struktur prioritas.

Prasyarat: Pohon Biner

1. Kth Largest Element in a Stream di LeetCode (easy)
2. Last Stone Weight di LeetCode (easy)
3. K Closest Points to Origin di LeetCode (medium)
4. Kth Largest Element in an Array di LeetCode (medium)
5. Task Scheduler di LeetCode (medium)
6. Design Twitter di LeetCode (medium)
7. Find Median from Data Stream di LeetCode (hard)