K-th Largest Element (0-indexed)

Problem Given an integer array nums and an integer k, return the k-th largest element in the array where k is 0-indexed: k = 0 returns the maximum element k = 1 returns the second largest element and so on. Examples: nums = [5, -3, 9, 1], k = 0 -> 9 nums = [5, -3, 9, 1], k = 1 -> 5 nums = [5, -3, 9, 1], k = 3 -> -3 Input/Output Input: integer array nums, integer k Output: an integer, the k-th largest element Constraints 1 <= len(nums) <= 2 * 10^5 -10^9 <= nums[i] <= 10^9 0 <= k < len(nums) Test Cases nums = [5, -3, 9, 1], k = 0 -> 9 nums = [5, -3, 9, 1], k = 1 -> 5 nums = [5, -3, 9, 1], k = 3 -> -3 nums = [2, 2, 2, 2], k = 2 -> 2 nums = [-1, -2, -3], k = 1 -> -2 Example Input 5 -3 9 1 0 Output 9