deven/leetcode
1
0
Fork 0
mirror of https://github.com/devenperez/leetcode.git synced 2026-06-15 09:57:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

Create README - LeetHub

Browse Source
This commit is contained in:
Deven
2025-11-26 20:01:45 -05:00
parent f6481508e2
commit 16adc41a13
1 changed files with 21 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
0215-kth-largest-element-in-an-array/README.md
+21
View File
@@ -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>