45. Kth Largest Element
MediumHeap / selection
Return the kth largest element in nums (in sorted order, counting duplicates). Can you beat O(n log n)?
Example 1
Input: nums = [3, 2, 1, 5, 6, 4], k = 2 Output: 5
Example 2
Input: nums = [3, 2, 3, 1, 2, 4, 5, 5, 6], k = 4 Output: 4
Constraints
1 ≤ k ≤ nums.length ≤ 10⁵