leetcode/apps/docs/content/(array)/215-kth-largest-element-in-an-array.mdx

---
title: '215. Kth Largest Element in an Array'
description: Given an integer array nums and an integer k, return the k^th largest element in the array
sidebar:
  label: 'Kth Largest Element in an Array'
  badge: 'Medium'
---

<Badge variant="accent">Heap / Priority Queue</Badge>

### Example 1:
- Input: `nums = [3,2,1,5,6,4], k = 2`
- Output: `5`

### Example 2:
- Input: `nums = [3,2,3,1,2,4,5,5,6], k = 4`
- Output: `4`

### Constraints:

- `1 <= k <= nums.length <= 10^5`
- `-10^4 <= nums[i] <= 10^4`

## Solution

```py
import heapq


class Solution:
    def findKthLargest(self, nums: List[int], k: int) -> int:
        for i in range(len(nums)):
            nums[i] = -nums[i]

        heapq.heapify(nums)

        for _ in range(k - 1):
            heapq.heappop(nums)

        return -heapq.heappop(nums)
```