Back

Kth Largest Element in an Array

medium

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?

Test Cases

Copy an input into the main harness and Run to verify
Input
nums = [3,2,1,5,6,4], k = 2
Expected Output
5
Input
nums = [3,2,3,1,2,4,5,5,6], k = 4
Expected Output
4

Constraints

  • 1 <= k <= nums.length <= 10^5
  • -10^4 <= nums[i] <= 10^4

Hints

Hint 1 — click to reveal

A min-heap of size k keeps the k largest elements seen so far.

Hint 2 — click to reveal

The heap's top is then the k-th largest.

Java Compiler

Powered by OneCompiler. Starter code loads automatically — edit and hit Run.