Added 2 solutions

varunu28 · varunu28 · commit d24d3a10d079 · 2019-08-07T08:01:59.000-07:00
diff --git a/Medium/Candy Crush.java b/Medium/Candy Crush.java
@@ -0,0 +1,42 @@
+class Solution {
+    public int[][] candyCrush(int[][] board) {
+        int rows = board.length;
+        int cols = board[0].length;
+        boolean flag = false;
+        
+        for (int i = 0; i < rows; i++) {
+            for (int j = 0; j + 2 < cols; j++) {
+                int val = Math.abs(board[i][j]);
+                if (val != 0 && val == Math.abs(board[i][j + 1]) && val == Math.abs(board[i][j + 2])) {
+                    board[i][j] = board[i][j + 1] = board[i][j + 2] = -val;
+                    flag = true;
+                }
+            }
+        }
+        
+        for (int i = 0; i + 2 < rows; i++) {
+            for (int j = 0; j < cols; j++) {
+                int val = Math.abs(board[i][j]);
+                if (val != 0 && val == Math.abs(board[i + 1][j]) && val == Math.abs(board[i + 2][j])) {
+                    board[i][j] = board[i + 1][j] = board[i + 2][j] = -val;
+                    flag = true;
+                }
+            }
+        }
+        
+        for (int i = 0; i < cols; ++i) {
+            int rightRow = rows - 1;
+            for (int j = rows - 1; j >= 0; --j) {
+                if (board[j][i] > 0) {
+                    board[rightRow--][i] = board[j][i];
+                }
+            }
+            
+            while (rightRow >= 0) {
+                board[rightRow--][i] = 0;
+            }
+        }
+        
+        return flag ? candyCrush(board) : board;
+    }
+}
diff --git a/Medium/Time Based Key-Value Store.java b/Medium/Time Based Key-Value Store.java
@@ -0,0 +1,56 @@
+class TimeMap {
+
+    /** Initialize your data structure here. */
+    Map<String, List<Entry>> map;
+    public TimeMap() {
+        map = new HashMap<>();
+    }
+
+    public void set(String key, String value, int timestamp) {
+        map.computeIfAbsent(key, k -> new ArrayList<>()).add(new Entry(value, timestamp));
+    }
+
+    public String get(String key, int timestamp) {
+        if (!map.containsKey(key)) {
+            return "";
+        }
+
+        return binarySearch(map.get(key), 0, map.get(key).size() - 1, timestamp);
+    }
+
+    private String binarySearch(List<Entry> entries, int left, int right, int timestamp) {
+        int idx = Integer.MIN_VALUE;
+        while (left <= right) {
+            int mid = (left + right) / 2;
+            if (entries.get(mid).timestamp == timestamp) {
+                return entries.get(mid).value;
+            }
+            else if (entries.get(mid).timestamp > timestamp) {
+                right = mid - 1;
+            }
+            else {
+                idx = Math.max(idx, mid);
+                left = mid + 1;
+            }
+        }
+        
+        return idx == Integer.MIN_VALUE ? "" : entries.get(idx).value;
+    }
+}
+
+class Entry {
+    String value;
+    int timestamp;
+
+    public Entry(String value, int timestamp) {
+        this.value = value;
+        this.timestamp = timestamp;
+    }
+}
+
+/**
+ * Your TimeMap object will be instantiated and called as such:
+ * TimeMap obj = new TimeMap();
+ * obj.set(key,value,timestamp);
+ * String param_2 = obj.get(key,timestamp);
+ */
