LeetCode 215 : Kth Largest Element in an Array

Solution to Kth Largest Element in an Array Problem. Here is a nice video which explains the approach.

class Solution {
    public int findKthLargest(int[] nums, int k) {
        PriorityQueue<Integer> minHeap = new PriorityQueue<>();
        
        for(int i : nums) {
            minHeap.add(i);
            if(minHeap.size() > k) {
                minHeap.remove();
            }
        }
        
        return minHeap.remove();
    }
}