Added 2 solutions to weekly contest

varunu28 · varunu28 · commit 57abe7f8d467 · 2018-09-29T20:04:05.000-07:00
diff --git a/Contests/Weekly Contest 104/Partition Array into Disjoint Intervals.java b/Contests/Weekly Contest 104/Partition Array into Disjoint Intervals.java
@@ -0,0 +1,25 @@
+class Solution {
+    public static int partitionDisjoint(int[] A) {
+        int[] min = new int[A.length];
+        int minVal = Integer.MAX_VALUE;
+
+        for (int i=A.length-1; i>=0; i--) {
+            minVal = Math.min(minVal, A[i]);
+            min[i] = minVal;
+        }
+
+        int[] max = new int[A.length];
+        int maxVal = Integer.MIN_VALUE;
+
+        for (int i=0; i<A.length; i++) {
+            maxVal = Math.max(maxVal, A[i]);
+            max[i] = maxVal;
+
+            if (i < A.length-1 && max[i] <= min[i+1]) {
+                return i + 1;
+            }
+        }
+
+        return A.length;
+    }
+}
diff --git a/Contests/Weekly Contest 104/X of a Kind in a Deck of Cards.java b/Contests/Weekly Contest 104/X of a Kind in a Deck of Cards.java
@@ -0,0 +1,47 @@
+class Solution {
+    public static boolean hasGroupsSizeX(int[] deck) {
+        Map<Integer, Integer> map = new HashMap<>();
+
+        for (int card: deck) {
+            map.put(card, map.getOrDefault(card, 0) + 1);
+        }
+
+        int X = -1;
+
+        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
+            if (entry.getValue() < 2) {
+                return false;
+            }
+
+            if (X == -1) {
+                X = entry.getValue();
+            }
+            else {
+                X = findGCD(X, entry.getValue());
+            }
+        }
+
+        if (X == 1) {
+            return false;
+        }
+
+        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
+            if (entry.getValue() % X != 0) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    private static int findGCD(int n1, int n2) {
+        while(n1 != n2) {
+            if(n1 > n2)
+                n1 -= n2;
+            else
+                n2 -= n1;
+        }
+
+        return n1;
+    }
+}
diff --git a/Medium/Search a 2D Matrix.java b/Medium/Search a 2D Matrix.java
@@ -0,0 +1,29 @@
+class Solution {
+    public static boolean searchMatrix(int[][] matrix, int target) {
+
+        if (matrix.length == 0) {
+            return false;
+        }
+
+        for (int i=0; i<matrix.length; i++) {
+            int start = 0;
+            int end = matrix[i].length-1;
+
+            while (start <= end) {
+                int mid = (start + end)/2;
+
+                if (matrix[i][mid] == target) {
+                    return true;
+                }
+                else if (matrix[i][mid] > target) {
+                    end = mid - 1;
+                }
+                else {
+                    start = mid + 1;
+                }
+            }
+        }
+
+        return false;
+    }
+}
