Kth Largest Element in an Array - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
215. Kth Largest Element in an Array
Medium
30 Points
Array
Divide and Conquer
Sorting
Heap (Priority Queue)
Quickselect
Given an integer array nums and an integer k, return the kth largest element in the array.
Note that it is the kth largest element in the sorted order, not the kth distinct element.
Can you solve it without sorting?
Examples
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 <= 105
-104 <= nums[i] <= 104
215. Kth Largest Element in an Array
Medium
30 Points
Array
Divide and Conquer
Sorting
Heap (Priority Queue)
Quickselect
Given an integer array nums and an integer k, return the kth largest element in the array.
Note that it is the kth largest element in the sorted order, not the kth distinct element.
Can you solve it without sorting?
Examples
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