0215-kth-largest-element-in-an-array.js

/**
 * 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}
 */
 var 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(K)) | Space O(K)
 * @param {number[]} nums
 * @param {number} k
 * @return {number}
 */
 var findKthLargest = function(nums, k) {
    const minHeap = new MinPriorityQueue()

    for (const num of nums) {
        minHeap.enqueue(num);

        const isAtCapacity = k < minHeap.size();
        if (isAtCapacity) minHeap.dequeue();
    }

    return minHeap.front().element
};