Kth Largest Element: Two Approaches

Concepts: pyKthLargest, pyMinHeapTopK, pyQuickSelect

LeetCode 215 is one of the most frequently asked heap problems at FAANG and FAANG-adjacent companies. Find the Kth largest element in an unsorted array. It is deceptively simple, but interviewers use it to filter candidates who know the theory from candidates who know when to apply which tool. There are two approaches you need to know: sort (simple, O(n log n)) and heap (efficient, O(n log k)). You should be able to code both and explain when each is appropriate. Approach 1: Sort The sort approach is fine for small n or when you need to impress with simplicity. Say it first. 'The straightforward approach is to sort descending and return index k-1. O(n log n) time.' Then offer the better solution. Interviewers appreciate that you know the easy solution before jumping to the complex one. It