Implement it on LeetCode. In Python, use heapq (a min-heap). In Java, use PriorityQueue. Alternative: QuickSelect algorithm gives average time, but worst case . For interviews, the heap solution is safer and easier to implement correctly. This "Top K" pattern appears everywhere: top K frequent elements, K closest points, K smallest elements. Know it well.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/heaps-priority-queues/kth-largest-element-implementation
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████████████████████████████████████████████████