 All Problems
Kth Largest Element in an Array
medium
heap
sorting
arrays
amazon
facebook
microsoft
google

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 sorted order, not the kth distinct element.

Example 1:

Input:
3 2 1 5 6 4
2
Output: 5

Example 2:

Input:
3 2 3 1 2 4 5 5 6
4
Output: 4

Constraints:

  • 1 ≤ k ≤ nums.length ≤ 10⁵
  • -10⁴ ≤ nums[i] ≤ 10⁴

Input format: First line: space-separated array. Second line: integer k.

Output format: A single integer.

Run to check your code against the sample cases, or submit to run every case