You've learned heap patterns. Kth Largest taught the "top K" pattern: use a heap of size to maintain the largest/smallest elements. Find Median showed the "two heaps" pattern: split elements into smaller and larger halves to quickly access the middle. Merge K Sorted Lists demonstrated k-way merging: use a heap to efficiently find the minimum among elements. When you need repeated access to the min/max, or need to maintain a running set of extreme values, think heap.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/heaps-priority-queues/section-recap
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████████████