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

Author: neetcode-gh

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

@@ -0,0 +1,20 @@
+class Solution:
+    def findKthLargest(self, nums: List[int], k: int) -> int:
+        nums.sort()
+        return nums[len(nums) - k]
+        
+        k = len(nums) - k
+        def quickSelect(l, r):
+            if l == r: return nums[l]
+            
+            pivot, p = nums[r], l
+            for i in range(l, r):
+                if nums[i] <= pivot:
+                    nums[p], nums[i] = nums[i], nums[p]
+                    p += 1
+            nums[p], nums[r] = nums[r], nums[p]
+            
+            if p > k:   return quickSelect(l, p - 1)
+            elif p < k: return quickSelect(p + 1, r)
+            else:       return nums[p]
+        return quickSelect(0, len(nums) - 1)