Create Kth Largest Element in an Array - Leetcode 215.py

Author: gahogg

Kth Largest Element in an Array - Leetcode 215.py

@@ -0,0 +1,32 @@
+import heapq
+class Solution:
+    def findKthLargest(self, nums: List[int], k: int) -> int:
+        for i in range(len(nums)):
+            nums[i] = -nums[i] # Max Heap
+
+        heapq.heapify(nums)
+
+        for _ in range(k-1):
+            heapq.heappop(nums)
+
+        return -heapq.heappop(nums)
+	      # Max Heap of size n
+        # Time: O(n + k log n)
+        # Space: O(1)    
+
+import heapq
+class Solution:
+    def findKthLargest(self, nums: List[int], k: int) -> int:
+        min_heap = []
+        
+        for num in nums:
+            if len(min_heap) < k:
+                heapq.heappush(min_heap, num)
+            else:
+                heapq.heappushpop(min_heap, num)
+        
+        return min_heap[0]
+        # Min heap of size k
+        # Time: O(n log k)
+        # Space: O(k)
+