Given an integer array nums and an integer k, return the kth largest element in the array. Note that it is the kth largest element in sorted order, not the kth distinct element.
Input: nums = [3,2,1,5,6,4], k = 2
Output: 5
Topics: heap, sorting
Asked by: Amazon, Google, Meta, Microsoft, Apple
Time complexity: O(n) Average. Space complexity: O(1).