Skip to interview prep
Apexed

45. Kth Largest Element

MediumHeap / selection

Return the kth largest element in nums (in sorted order, counting duplicates). Can you beat O(n log n)?

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⁵

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Run checks these cases; the expected output comes from the reference solution. Submit judges all 4 hidden and sample tests.

Code runs only in your browser in an isolated sandbox. Progress and submissions are saved on this device.

Kth Largest Element — coding interview practice — Apexed