findKthLargest = function(nums, k) { return nums
    .sort((a, b) => a - b)
    .reverse()
    .slice(k - 1)
    .shift()
}
https://leetcode.com/problems/kth-largest-element-in-an-array/
Time O(N * log(N)) | Space O(K)
@param {number[]} nums
@param {number} k
@return {number}