Kth Largest Element in an Array

Given an integer array `nums` and an integer `k`, return the `k`th largest element in the array. Note that it is the `k`th largest element in the sorted order, not the `k`th distinct element. Can you solve it without sorting? **Example 1:** Input: nums = [3,2,1,5,6,4], k = 2 Output: 5 **Example 2:** Input: nums = [3,2,3,1,2,4,5,5,6], k = 4 Output: 4 **Example 3:** Input: nums = [1], k = 1 Output: 1 **Hint:** Use a min-heap of size k, or the QuickSelect algorithm for average O(n) time.