feat(0789_kth-largest-element-in-a-stream): add py3 soln

0789_kth-largest-element-in-a-stream/python3/naive_approach_tle.py

@@ -0,0 +1,45 @@
+# Naive approach, will TLE
+# Time for each add: O(k)
+class KthLargest:
+
+    def __init__(self, k: int, nums: List[int]):
+        self.k = k
+        
+        len_nums = len(nums)
+        
+        # Only keep max k elements, rest are useless
+        if len_nums >= k:
+            self.nums = sorted(nums)[len_nums - k:]
+        # If we're provided less than k elements, we
+        # will it up with least possible number
+        else:
+            self.nums = [
+                *([float("-inf")] * (k - len_nums)),
+                *sorted(nums)
+            ]
+
+    def add(self, val: int) -> int:
+        # Find the right place for val in the list
+        # of length k
+        
+        i = self.k - 1
+        while i >= 0 and val < self.nums[i]:
+            i -= 1
+        
+        # If val is big enough to fit in the list, shift
+        # existing elements to left
+        j = 0
+        while j < i:
+            self.nums[j] = self.nums[j + 1]
+            j += 1
+        
+        if i >= 0:
+            self.nums[i] = val
+        
+        # kth largest element is always at index 0
+        return self.nums[0]
+
+
+# Your KthLargest object will be instantiated and called as such:
+# obj = KthLargest(k, nums)
+# param_1 = obj.add(val)

0789_kth-largest-element-in-a-stream/python3/solution.py

@@ -0,0 +1,26 @@
+import heapq
+
+class KthLargest:
+
+    def __init__(self, k: int, nums: List[int]):
+        self.k = k
+        self.heap = nums
+        heapq.heapify(self.heap)
+        
+        # Keep removing elements until heap size is k
+        while len(self.heap) > k:
+            heapq.heappop(self.heap)
+        
+
+    def add(self, val: int) -> int:
+        heapq.heappush(self.heap, val)
+        
+        if len(self.heap) > self.k:
+            heapq.heappop(self.heap)
+        
+        return self.heap[0]
+
+
+# Your KthLargest object will be instantiated and called as such:
+# obj = KthLargest(k, nums)
+# param_1 = obj.add(val)