To solve this problem, you'll have to open it on the computer

Kth Largest Element in an Array

Heaps
easy
Score: 40

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.

Input Format

First Parameter: number n

Second Parameter - array nums of size n

Third Parameter - number k

Output Format

Return the number.

Example 1

Input :
    6
    3 2 1 5 6 4
    2

Output : 
    5

Example 2

Input : 
    9
    3 2 3 1 2 4 5 5 6
    4

Output : 
    4

Constraints:

  • 1 <= k <= n <= 104.
  • -104 <= nums[i] <= 104.
  • Expected Time Complexity : O(nlogk).
  • Expected Space Complexity : O(k)
Submit code to see the your result here