From 393d72c9fe6ddd1108d38702fc6f601eebc2decf Mon Sep 17 00:00:00 2001
From: Prad Nukala <prad@sonr.io>
Date: Mon, 14 Sep 2026 12:21:51 -0400
Subject: [PATCH] docs(docs): add MDX page for LeetCode 215 Kth Largest Element
 in an Array

---
 .../215-kth-largest-element-in-an-array.mdx   | 41 +++++++++++++++++++
 1 file changed, 41 insertions(+)
 create mode 100644 apps/docs/content/(array)/215-kth-largest-element-in-an-array.mdx

diff --git a/apps/docs/content/(array)/215-kth-largest-element-in-an-array.mdx b/apps/docs/content/(array)/215-kth-largest-element-in-an-array.mdx
new file mode 100644
index 0000000..83a822f
--- /dev/null
+++ b/apps/docs/content/(array)/215-kth-largest-element-in-an-array.mdx
@@ -0,0 +1,41 @@
+---
+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)
+```