Kth Largest Element in an Array

**Problem Statement:** Given the required input arguments, write an efficient algorithm to solve the **Kth Largest Element in an Array** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge. **Hint / Expected Approach:** Min-heap of size k OR QuickSelect O(n) avg **Edge Cases to Consider:** - (1) k = 1 - (2) k = n - (3) Duplicates in array

Examples

Example 1

Input: [3,2,1,5,6,4], 2

Output: 5

Example 2

Input: [3,2,3,1,2,4,5,5,6], 4

Output: 4

Example 3

Input: [1], 1

Output: 1

Explanation: Single

Constraints

▪Input arguments are within valid ranges
▪Optimize for execution speed
▪Handle null/empty inputs gracefully

Watch Out For Edge Cases

▪k = 1
▪k = n
▪Duplicates in array

Frequently Asked At

AmazonGoogleMicrosoftMetaAdobeUberFlipkart

Back to Arena

medium

Heap