def findKthLargest(self, nums, k):
:type nums: List[int]
:type k: int
Interestingly, this O(nlogn) solution is somehow comparable to O(n) quick select solution's performance. But it will fail interview, almost for sure. LOL
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.