From 16adc41a13bcdc4cf3667424be6ed9b767fe67d5 Mon Sep 17 00:00:00 2001
From: Deven <63876261+devenperez@users.noreply.github.com>
Date: Wed, 26 Nov 2025 20:01:45 -0500
Subject: [PATCH] Create README - LeetHub

---
 .../README.md                                 | 21 +++++++++++++++++++
 1 file changed, 21 insertions(+)
 create mode 100644 0215-kth-largest-element-in-an-array/README.md

diff --git a/0215-kth-largest-element-in-an-array/README.md b/0215-kth-largest-element-in-an-array/README.md
new file mode 100644
index 0000000..298cc5a
--- /dev/null
+++ b/0215-kth-largest-element-in-an-array/README.md
@@ -0,0 +1,21 @@
+<h2><a href="https://leetcode.com/problems/kth-largest-element-in-an-array">215. Kth Largest Element in an Array</a></h2><h3>Medium</h3><hr><p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the</em> <code>k<sup>th</sup></code> <em>largest element in the array</em>.</p>
+
+<p>Note that it is the <code>k<sup>th</sup></code> largest element in the sorted order, not the <code>k<sup>th</sup></code> distinct element.</p>
+
+<p>Can you solve it without sorting?</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+<pre><strong>Input:</strong> nums = [3,2,1,5,6,4], k = 2
+<strong>Output:</strong> 5
+</pre><p><strong class="example">Example 2:</strong></p>
+<pre><strong>Input:</strong> nums = [3,2,3,1,2,4,5,5,6], k = 4
+<strong>Output:</strong> 4
+</pre>
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= k &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>-10<sup>4</sup> &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
+</ul>