Kth Largest Element in an Array

Problem Given an unsorted integer array and an integer k, return the kth largest element (not the kth distinct element).

Input / Output

• Input: integer array nums, integer k.
• Output: the kth largest value.

Constraints

• 1 ≤ k ≤ nums.length ≤ 10^5

Example

• nums = [3,2,1,5,6,4], k = 2 → 5