Kth Largest Element in an Array
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.
Kth Largest Element in an Array

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.

Example 1:
Input: {"nums":[3,2,1,5,6,4],"k":2}
Output: 5
Input
arr ={"nums":[3,2,1,5,6,4],"k":2}

Find the 2nd largest element using min heap of size k

Input Array (k=2)
3
2
1
5
6
4
Min Heap (size 0/2)

Empty

Current
Heap Top (kth largest)
In Heap
Variables
No variables to display
DepthFunction Call
Stack empty
0/11