Kth largest element
Mediumheapsortingquickselect
Return the k-th element if nums were sorted from largest to smallest (duplicates count). Try to avoid sorting the whole array.
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⁵
Submit checks your solution against 7 tests, including hidden ones.
/**
* @param {int[]} nums
* @param {int} k
* @return {int}
*/
function kthLargest(nums, k) {
}