Kth Largest Element in an Array

medium

Acceptance: 48%

HeapSortingDivide and Conquer

From an integer array, find the element that would appear at position k from the end if the array were sorted in ascending order. This is the kth largest value, counting duplicates separately.

Examples

Example 1:

Input:nums = [7,4,6,3,9,1], k = 3

Output:6

Example 2:

Input:nums = [5,5,5,2,2,1], k = 4

Output:2

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Kth Largest Element in an Array

Examples

Hints

Related Problems