developer-roadmap/roadmaps/leetcode/content/kth-largest-element-in-an-array@tMvbBpZDawi2RjSFgOaWc.md

Kth Largest Element in an Array

Given an unsorted array and an integer k, return the kth largest element. You can use a min-heap of size k: iterate through the array, push each element, and pop when the heap exceeds k. The top of the heap is then the kth largest. This problem teaches the core heap pattern: maintain a fixed-size heap to track top-k elements without sorting the entire array.

Visit the following resources to learn more:

• @article@Kth Largest Element in an Array
• @video@Kth Largest Element in an Array
• @video@Kth Largest Element in an Array - Heaps (Python)