Added 4 solutions

varunu28 · varunu28 · commit 3fef036cb995 · 2018-09-24T14:17:58.000-07:00
diff --git a/Contests/Weekly Contest 103/Smallest Range II.java b/Contests/Weekly Contest 103/Smallest Range II.java
@@ -0,0 +1,16 @@
+class Solution {
+    public int smallestRangeII(int[] A, int K) {
+        int N = A.length;
+        Arrays.sort(A);
+        int ans = A[N-1] - A[0];
+
+        for (int i=0; i<N-1; i++) {
+            int max = Math.max(A[N-1] - K, A[i] + K);
+            int min = Math.min(A[0] + K, A[i+1] - K);
+
+            ans = Math.min(ans, max - min);
+        }
+
+        return ans;
+    }
+}
diff --git a/Easy/Groups of Special-Equivalent Strings.java b/Easy/Groups of Special-Equivalent Strings.java
@@ -0,0 +1,23 @@
+class Solution {
+    public static int numSpecialEquivGroups(String[] A) {
+        Set<String> set = new HashSet<>();
+
+        for (String s : A) {
+            int[] even = new int[26];
+            int[] odd = new int[26];
+
+            for (int i=0; i<s.length(); i++) {
+                if (i%2 == 0) {
+                    even[s.charAt(i) - 'a']++;
+                }
+                else {
+                    odd[s.charAt(i) - 'a']++;
+                }
+            }
+
+            set.add(Arrays.toString(even) + "|" + Arrays.toString(odd));
+        }
+
+        return set.size();
+    }
+}
diff --git a/Easy/Magic Squares In Grid.java b/Easy/Magic Squares In Grid.java
@@ -0,0 +1,49 @@
+class Solution {
+    public int numMagicSquaresInside(int[][] grid) {
+        int rows = grid.length;
+        int col = grid[0].length;
+        int count = 0;
+
+        for (int i=0; i<=rows-3; i++) {
+            for (int j=0; j<=col-3; j++) {
+                if(checker(i, j, grid)) {
+                    count++;
+                }
+            }
+        }
+
+        return count;
+    }
+
+    private boolean checker(int x,int y,int[][] grid){
+        if(grid[x+1][y+1]!=5) {
+            return false;
+        }
+
+        int[] valid=new int[16];
+
+        for(int i=x;i<=x+2;i++) {
+            for(int j=y;j<=y+2;j++) {
+                valid[grid[i][j]]++;
+            }
+        }
+
+        for (int v = 1; v <= 9; v++) {
+            if (valid[v] != 1) {
+                return false;
+            }
+        }
+
+        if ((grid[x][y]+grid[x][y+1]+grid[x][y+2])!=15 ||
+            (grid[x][y]+grid[x+1][y+1]+grid[x+2][y+2])!=15 ||
+            (grid[x][y]+grid[x+1][y]+grid[x+2][y])!=15 ||
+            (grid[x+2][y]+grid[x+2][y+1]+grid[x+2][y+2])!=15 ||
+            (grid[x][y+2]+grid[x+1][y+2]+grid[x+2][y+2])!=15 ||
+            (grid[x][y+2]+grid[x+1][y+1]+grid[x+2][y])!=15) {
+            
+            return false;
+        }
+        
+        return true;
+    }
+}
diff --git a/Easy/Maximize Distance to Closest Person.java b/Easy/Maximize Distance to Closest Person.java
@@ -0,0 +1,28 @@
+class Solution {
+    public static int maxDistToClosest(int[] seats) {
+        int left = -1;
+        int max = 0;
+        int length = seats.length;
+
+        for (int i=0; i<length; i++) {
+            if (seats[i] == 0) {
+                continue;
+            }
+
+            if (left == -1) {
+                max = Math.max(max, i);
+            }
+            else {
+                max = Math.max(max, (i-left)/2);
+            }
+
+            left = i;
+        }
+
+        if (seats[length - 1] == 0) {
+            max = Math.max(max, length - 1 - left);
+        }
+        
+        return max;
+    }
+}
