You must make use of at least one Heap. You must solve this in 0(n) time...

 

Transcribed Image Text:

You must make use of at least one Heap. You must solve this in 0(n) time complexity. 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 the sorted order, not the kth distinct element. Example 1: Input: nuns [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 You must make use of at least one Heap. You must solve this in 0(n) time complexity. 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 the sorted order, not the kth distinct element. Example 1: Input: nuns [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

Answer rating: 100% (QA)

in array whose sum results in x class GFG Function to find and print pair static boolean chk... View the full answer