leetcode

commit 3eac7b343ae42dd569977f371a49f2e089820810
parent 7e28157058cc4aa3931accbd6e9ab27ca362dfc8
Author: Andrew Laack <andrew@laack.co>
Date:   Wed,  2 Jul 2025 10:54:46 -0500

Completed kth largest element in a stream

Diffstat:
D
kth-largest-element-in-a-stream/kth-largest-element-in-a-streamV1.
 | 
0

A
kth-largest-element-in-a-stream/kth-largest-element-in-a-streamV1.py
 | 
26
++++++++++++++++++++++++++

2 files changed, 26 insertions(+), 0 deletions(-)
diff --git a/kth-largest-element-in-a-stream/kth-largest-element-in-a-streamV1. b/kth-largest-element-in-a-stream/kth-largest-element-in-a-streamV1.
diff --git a/kth-largest-element-in-a-stream/kth-largest-element-in-a-streamV1.py b/kth-largest-element-in-a-stream/kth-largest-element-in-a-streamV1.py
@@ -0,0 +1,26 @@
+from heapq import heappush, heappop, nlargest
+
+class KthLargest:
+
+    def __init__(self, k: int, nums: List[int]):
+        self.ls = nums
+        self.ls.sort()
+
+        while len(self.ls) > k:
+            self.ls = self.ls[1:]
+
+        self.k = k
+
+    def add(self, val: int) -> int:
+        self.ls.append(val)
+        self.ls.sort()
+        ret_val = self.ls[-self.k]
+
+        while len(self.ls) > self.k:
+            self.ls = self.ls[1:]
+        
+        return ret_val
+
+# Your KthLargest object will be instantiated and called as such:
+# obj = KthLargest(k, nums)
+# param_1 = obj.add(val)