Medium
Description
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?
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โต
-10โด <= nums[i] <= 10โด
Solutions
๐ Already have an account?
Please log in to view the solution
๐ Don't have an account yet?
Access to detailed solutions requires an active subscription account. Get one now ๐
๐ Premium Content
This solution requires an active subscription to view.
Already subscribed? Try refreshing the page.