leetcode

commit 728eede3fb86c5359705e1581c57d98095bbfdb6
parent e696de5e2d3edfa215be03e899454536a52b3fa9
Author: Andrew Laack <andrew@laack.co>
Date:   Mon,  7 Jul 2025 14:11:56 -0500

Completed kth largest element in an array

Diffstat:
A
kth-largest-element-in-an-array/kth-largest-element-in-an-arrayV1.py
 | 
8
++++++++

1 file changed, 8 insertions(+), 0 deletions(-)
diff --git a/kth-largest-element-in-an-array/kth-largest-element-in-an-arrayV1.py b/kth-largest-element-in-an-array/kth-largest-element-in-an-arrayV1.py
@@ -0,0 +1,8 @@
+import heapq
+
+
+class Solution:
+    def findKthLargest(self, nums: List[int], k: int) -> int:
+        nums = [-num for num in nums]
+        heapq.heapify(nums)
+        return -heapq.nsmallest(k, nums)[-1]