From 1b166a19b67cd312e1ac3307efaa3a4b75f399c8 Mon Sep 17 00:00:00 2001
From: Deven <63876261+devenperez@users.noreply.github.com>
Date: Wed, 26 Nov 2025 20:03:16 -0500
Subject: [PATCH] Time: 35 ms (96.78%), Space: 28.7 MB (69.5%) - LeetHub

---
 .../0215-kth-largest-element-in-an-array.py                    | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/0215-kth-largest-element-in-an-array/0215-kth-largest-element-in-an-array.py b/0215-kth-largest-element-in-an-array/0215-kth-largest-element-in-an-array.py
index 2504c7c..2b9cf11 100644
--- a/0215-kth-largest-element-in-an-array/0215-kth-largest-element-in-an-array.py
+++ b/0215-kth-largest-element-in-an-array/0215-kth-largest-element-in-an-array.py
@@ -10,7 +10,8 @@ class Solution:
         # iterate over k+1...n - O(n) times
         #  - if larger than min in heap, replace min - O(log k)
         #  - else do nothing
-        for num in nums:
+        for i in range(k, len(nums)):
+            num = nums[i]
             if num > heap[0]:
                 heapq.heapreplace(heap, num)