Kth Largest Element in an Array
Explore how to identify the kth largest element in an unsorted array by understanding problem requirements and constraints. This lesson guides you through practical methods and coding exercises to effectively solve this common interview problem.
We'll cover the following...
Statement
Given an integer array, nums, and an integer, k, determine and return the kth largest element in the array.
Note: The
kthlargest element is defined with respect to the array’s sorted order (descending), and does not necessarily correspond to thekthunique value.
Constraints:
-
knums.length -
nums[i]
Examples
Understand the problem
Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:
Kth Largest Element in an Array
What is the 4th largest element in the following unsorted array?
[5, 12, 9, 0, 6, 7, 1, 8, 4, 9]
9
7
8
6
Figure it out!
We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.
Try it yourself
Implement your solution in main.js in the following coding playground:
import { MinHeap, MaxHeap } from './Heap.js'/* The following definition is for MinHeap.You can use the same methods for MaxHeap.class MinHeap {size(); // return number of elementspeek(); // return top element without removingpush(val); // insert elementpop(); // remove and return top element}*/function findKthLargest(nums, k){// Replace this placeholder return statement with your codereturn -1}export {findKthLargest}