Heap / Priority Queue/Medium

Kth Largest Element in an ArrayPRO PASS

Time: O(N log K)Space: O(K)

Step 1: Setup & Initialization - Kth Largest Element

Maintain a Min-Heap of size K while iterating array.

Array Elements & Pointers

[0]

[1]

[2]

[3]

[4]

Live Variables & Invariants

status:Initialized

pattern:Kth Largest Element

Step 1 / 333%

Solution Code

function findKthLargest(nums: number[], k: number): number {

  nums.sort((a, b) => b - a);

  return nums[k - 1];

Custom Test Case Runner

Input your custom values and visualize step-by-step trace

Array Input (comma separated):

Quick Presets:

AI DSA Coach

Contextual Tutor for Kth Largest Element in an Array

Hello! I am your AI DSA Tutor for **Kth Largest Element in an Array** (Heap / Priority Queue). Ask me anything about this algorithm, time complexity, or request a step hint!