Create 215-Kth-Largest-Element-in-an-Array.java

GauravVarshikar · web-flow · commit 76a043ec30f0 · 2022-04-27T00:06:55.000+05:30
Solution of Kth Largest Element in an array using a heap

Leetcode result: Runtime: 7 ms, faster than 45.05% of Java online submissions for Kth Largest Element in an Array.
Memory Usage: 45.5 MB, less than 13.98% of Java online submissions for Kth Largest Element in an Array.
diff --git a/java/215-Kth-Largest-Element-in-an-Array.java b/java/215-Kth-Largest-Element-in-an-Array.java
@@ -0,0 +1,19 @@
+class Solution {
+    public int findKthLargest(int[] nums, int k) {
+      //create a min heap
+        PriorityQueue<Integer> heap = new PriorityQueue();
+      
+      //iterate over the array
+        for(int n: nums){
+          //first add the integer to heap
+            heap.add(n);
+          //if size of the heap is greater than k
+            if(heap.size() > k){
+              //remove the root element (lowest of all)
+                heap.poll();
+            }
+        }
+      //finally heap has k largest elements left with root as the kth largest element
+        return heap.peek();
+    }
+}
