Added 2 solutions

varunu28 · varunu28 · commit 2287a5f659ad · 2018-10-08T18:15:45.000-07:00
diff --git a/Easy/Kth Largest Element in a Stream.java b/Easy/Kth Largest Element in a Stream.java
@@ -0,0 +1,31 @@
+class KthLargest {
+    PriorityQueue<Integer> priorityQueue;
+    int k;
+
+    public KthLargest(int k, int[] nums) {
+        this.k = k;
+        priorityQueue = new PriorityQueue<>(k);
+
+        for (int num : nums) {
+            priorityQueue.offer(num);
+            if (priorityQueue.size() > k) {
+                priorityQueue.poll();
+            }
+        }
+    }
+
+    public int add(int val) {
+        priorityQueue.offer(val);
+        if (priorityQueue.size() > k) {
+            priorityQueue.poll();
+        }
+
+        return priorityQueue.peek();
+    }
+}
+
+/**
+ * Your KthLargest object will be instantiated and called as such:
+ * KthLargest obj = new KthLargest(k, nums);
+ * int param_1 = obj.add(val);
+ */
diff --git a/Medium/H-Index.java b/Medium/H-Index.java
@@ -0,0 +1,16 @@
+class Solution {
+    public int hIndex(int[] citations) {
+        Arrays.sort(citations);
+        int end = citations.length;
+        int ind = 0;
+        
+        for (int i=0; i<end; i++) {
+            if (citations[i] >= end - i) {
+                ind = end - i;
+                break;
+            }
+        }
+        
+        return ind;
+    }
+}
