solves kth largets element in stream

Author: anishLearnsToCode

README.md

@@ -1,8 +1,8 @@
 # LeetCode Algorithms
 
-![problems-solved](https://img.shields.io/badge/Problems%20Solved-170/2081-1f425f.svg)
-![problems-solved-java](https://img.shields.io/badge/Java-170/2081-1abc9c.svg)
-![problems-solved-python](https://img.shields.io/badge/Python-170/2081-1abc9c.svg)
+![problems-solved](https://img.shields.io/badge/Problems%20Solved-171/2081-1f425f.svg)
+![problems-solved-java](https://img.shields.io/badge/Java-171/2081-1abc9c.svg)
+![problems-solved-python](https://img.shields.io/badge/Python-171/2081-1abc9c.svg)
 [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)
 [![cp](https://img.shields.io/badge/also%20see-Competitve%20Programming-1f72ff.svg)](https://github.com/anishLearnsToCode/competitive-programming)
 
@@ -191,7 +191,7 @@
 | 696 | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [![Java](assets/java.png)](src/CountBinarySubstrings.java) [![Python](assets/python.png)](python/count_binary_substrings.py) |
 | 697 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [![Java](assets/java.png)](src/DegreeOfAnArray.java) [![Python](assets/python.png)](python/degree_of_an_array.py) |
 | 700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [![Java](assets/java.png)](src/SearchInBinarySearchTree.java) [![Python](assets/python.png)](python/search_in_binary_search_tree.py) |
-| 703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | |
+| 703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [![Java](assets/java.png)](src/KthLargestElementInAStream.java) [![Python](assets/python.png)](python/k_th_largest_element_in_a_stream.py) |
 | 704 | [Binary Search](https://leetcode.com/problems/binary-search) | |
 | 705 | [Design HashSet](https://leetcode.com/problems/design-hashset) | |
 | 706 | [Design HashMap](https://leetcode.com/problems/design-hashmap) | |

python/k_th_largest_element_in_a_stream.py

@@ -0,0 +1,18 @@
+import heapq
+from typing import List
+
+
+class KthLargest:
+    def __init__(self, k: int, nums: List[int]):
+        self.heap = []
+        self.heap_size = k
+        for element in nums:
+            heapq.heappush(self.heap, element)
+        while len(self.heap) > self.heap_size:
+            heapq.heappop(self.heap)
+
+    def add(self, val: int) -> int:
+        heapq.heappush(self.heap, val)
+        while len(self.heap) > self.heap_size:
+            heapq.heappop(self.heap)
+        return self.heap[0]

src/KthLargestElementInAStream.java

@@ -0,0 +1,28 @@
+import java.util.PriorityQueue;
+import java.util.Queue;
+
+public class KthLargestElementInAStream {
+    class KthLargest {
+
+        private final Queue<Integer> heap = new PriorityQueue<>();
+        private final int heapSize;
+
+        public KthLargest(int k, int[] nums) {
+            heapSize = k;
+            for (int element : nums) {
+                heap.add(element);
+            }
+            while (heap.size() > heapSize) {
+                heap.poll();
+            }
+        }
+
+        public int add(int val) {
+            heap.add(val);
+            while (heap.size() > heapSize) {
+                heap.poll();
+            }
+            return heap.peek();
+        }
+    }
+}