Merge pull request vJechsmayr#563 from OMEGAeNcore/LeetCode/omega

Adding Kth Largest Element in an Array Solution

Author: vJechsmayr

LeetCode/0215_Kth_Largest_Element_In_An_Array.py

@@ -0,0 +1,6 @@
+import heapq
+class Solution:
+ def findKthLargest(self, nums: List[int], k: int) -> int:
+ heapq.heapify(nums)
+ res = heapq.nlargest(k,nums)
+ return res[len(res)-1]