Added More Solutions

Author: architg-op

Priority Queue/Median of Running Array/MedianRunning.java

@@ -0,0 +1,65 @@
+/*
+ * To change this license header, choose License Headers in Project Properties.
+ * To change this template file, choose Tools | Templates
+ * and open the template in the editor.
+ */
+
+/**
+ *
+ * @author architgarg
+ */
+import java.util.*;
+public class MedianRunning {
+    public static void main(String args[]) {
+        int a[] = {1, 9, 8, 19, 15, 5};
+        double arr[] = findMedian(a);
+        for (int i = 0; i < arr.length; i++) {
+            System.out.print(arr[i] + " ");
+        }
+    }
+    
+    public static double[] findMedian(int a[]) {
+        PriorityQueue<Integer> lowers = new PriorityQueue<>(new Comparator<Integer>() {
+            @Override
+            public int compare(Integer o1, Integer o2) {
+                return -1 * o1.compareTo(o2);
+            }
+            
+        });
+        PriorityQueue<Integer> highers = new PriorityQueue<>();
+        double median[] = new double[a.length];
+        for (int i = 0; i < a.length; i++) {
+            int number = a[i];
+            addNumber(number, lowers, highers);
+            rebalance(lowers, highers);
+            median[i] = getMedian(lowers, highers);
+        }
+      
+        return median;
+    }
+    
+    public static void addNumber(int number, PriorityQueue<Integer> lowers, PriorityQueue<Integer> highers) {
+        if (lowers.size() == 0 || number < lowers.peek()) {
+            lowers.add(number);
+        }
+        else 
+            highers.add(number);
+    }
+    
+    public static void rebalance(PriorityQueue<Integer> lowers, PriorityQueue<Integer> highers) {
+        PriorityQueue<Integer> biggerHeap = lowers.size() > highers.size() ? lowers : highers;
+        PriorityQueue<Integer> smallerHeap = lowers.size() > highers.size() ? highers : lowers;
+        if ((biggerHeap.size() - smallerHeap.size()) >= 2) {
+            smallerHeap.add(biggerHeap.poll());
+        }
+    }
+    
+    public static double getMedian(PriorityQueue<Integer> lowers, PriorityQueue<Integer> highers) {
+        PriorityQueue<Integer> biggerHeap = lowers.size() > highers.size() ? lowers : highers;
+        PriorityQueue<Integer> smallerHeap = lowers.size() > highers.size() ? highers : lowers;
+        if (biggerHeap.size() == smallerHeap.size()) {
+            return ((double)(biggerHeap.peek() + smallerHeap.peek()) / 2 );
+        }
+        return biggerHeap.peek();
+    }
+}

TreeMap/Busiest Time in the Mall/BTM.java

@@ -0,0 +1,71 @@
+/*
+ * To change this license header, choose License Headers in Project Properties.
+ * To change this template file, choose Tools | Templates
+ * and open the template in the editor.
+ */
+
+/**
+ *
+ * @author architgarg
+ */
+import java.util.*;
+public class BTM {
+    public static void main(String args[]) {
+        Map<Long, Integer> tm = new TreeMap<>();
+        Scanner sc = new Scanner(System.in);
+        int n = 6;
+        long[] timestamp = {1472568095, 1472620192, 1472630264, 1472635488, 1472641430, 1472635488};
+        int people[] = {59, 50, 5, 59, 60, 2};
+        int currPeople = 0;
+        String status[] = {"E", "X", "X", "E", "X", "X"};
+        for (int i = 0; i < n; i++) {
+            if (status[i].equals("E")) {
+                currPeople += people[i];
+                if (tm.containsKey(timestamp[i])) {
+                    int val = tm.get(timestamp[i]);
+                    val += currPeople;
+                    tm.put(timestamp[i], val);
+                }
+                else {
+                    tm.put(timestamp[i], currPeople);
+                }
+            }
+            else {
+                currPeople -= people[i];
+                if (tm.containsKey(timestamp[i])) {
+                    int val = tm.get(timestamp[i]);
+                    val -= currPeople;
+                    tm.put(timestamp[i], val);
+                }
+                else {
+                    tm.put(timestamp[i], currPeople);
+                }
+            }
+        }
+        int maxPeople = 0;
+        long maxTimeStamp = 0;
+        long secTimeStamp = 0;
+       int f = 0;
+        for (Map.Entry<Long, Integer> entry : tm.entrySet()) {
+            if (f == 1) {
+                secTimeStamp = entry.getKey();
+                f = 0;
+            }
+            if (entry.getValue() > maxPeople) {
+                maxPeople = entry.getValue();
+                maxTimeStamp = entry.getKey();
+                f = 1;
+            }
+        }
+        //System.out.println(maxTimeStamp);
+       /* for (Map.Entry<Long, Integer> entry : tm.entrySet()) {
+            if (f == 1) {
+                
+            }
+            if (entry.getKey() == maxTimeStamp) {
+                f = 1;
+            }
+        }*/
+       System.out.println("" + maxTimeStamp + " " + secTimeStamp);
+    }
+}