Leetcode Problem 215. Kth Largest Element in an Array

215. Kth Largest Element in an Array

Leetcode Solutions

Approach: Min-Heap

Initialize a min-heap.
Iterate over each element in the array. a. Add the current element to the heap. b. If the heap size exceeds k, remove the smallest element from the heap.
The root of the heap is the kth largest element, return it.

Approach: Sort

Ask Question

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen

Loading...

Suggested Answer

Answer

Full Screen

Copy Answer Code

Loading...