mediumHeap & Priority Queue
Kth Largest Element in an Array
## Problem
Given an integer array `nums` and an integer `k`, return the `k`th largest element in the array.
Note that it is the `k`th largest element in the sorted order, not the `k`th distinct element.
Can you solve it without sorting?
Given an integer array `nums` and an integer `k`, return the `k`th largest element in the array.
Note that it is the `k`th largest element in the sorted order, not the `k`th distinct element.
Can you solve it without sorting?
Examples
Input
nums = [3,2,1,5,6,4], k = 2
Output
5
Sorted: [1,2,3,4,5,6]. 2nd largest is 5.
Input
nums = [3,2,3,1,2,4,5,5,6], k = 4
Output
4
Sorted: [1,2,2,3,3,4,5,5,6]. 4th largest is 4.
Constraints
1 <= k <= nums.length <= 10^5
-10^4 <= nums[i] <= 10^4
Python
Loading...