Merge remote-tracking branch 'origin/master'

Author: gouthampradhan

problems/src/Minesweeper.java

@@ -0,0 +1,67 @@
+/**
+ * Created by pradhang on 3/28/2017.
+ * Accepted
+ */
+public class Minesweeper
+{
+    private static final int[] R = {1, 1, 1, 0, 0, -1, -1, -1};
+    private static final int[] C = {-1, 0, 1, -1, 1, -1, 0, 1};
+    /**
+     * Main method
+     * @param args
+     * @throws Exception
+     */
+    public static void main(String[] args) throws Exception
+    {
+        char[][] board = {{'E','E','E','E','E'},{'E','E','M','E','E'},{'E','E','E','E','E'},{'E','E','E','E','E'}};
+        int[] click = {3, 0};
+        new Minesweeper().updateBoard(board, click);
+        for (int i = 0; i < board.length; i ++)
+            System.out.println(board[i]);
+    }
+
+    public char[][] updateBoard(char[][] board, int[] click)
+    {
+        int r = click[0];
+        int c = click[1];
+        dfs(board, r, c);
+        return board;
+    }
+
+    private void dfs(char[][] board, int r, int c)
+    {
+        if(board[r][c] == 'M')
+        {
+            board[r][c] = 'X';
+        }
+        else
+        {
+            int mineCount = 0;
+            for(int i = 0; i < 8; i ++)
+            {
+                int newR = r + R[i];
+                int newC = c + C[i];
+                if(newR >=0 && newC >= 0 && newR < board.length && newC < board[0].length &&
+                        board[newR][newC] == 'M') //boundary check
+                    mineCount++;
+            }
+            if(mineCount > 0)
+                board[r][c] = (char)(mineCount + '0');
+            else
+            {
+                board[r][c] = 'B';
+                for(int i = 0; i < 8; i ++)
+                {
+                    int newR = r + R[i];
+                    int newC = c + C[i];
+                    if(newR >=0 && newC >= 0 && newR < board.length && newC < board[0].length &&
+                            board[newR][newC] == 'E') //boundary check
+                    {
+                        dfs(board, newR, newC);
+                    }
+                }
+            }
+        }
+    }
+}
+

problems/src/SetMatrixZeroes.java

@@ -0,0 +1,56 @@
+import java.util.HashSet;
+import java.util.Set;
+
+/**
+ * Created by pradhang on 3/28/2017.
+ * Accepted
+ */
+public class SetMatrixZeroes
+{
+    /**
+     * Main method
+     * @param args
+     * @throws Exception
+     */
+    public static void main(String[] args) throws Exception
+    {
+        int[][] matrix = {{0, 8, 7}, {9, 0, 8}, {9, 9, 0}};
+
+        new SetMatrixZeroes().setZeroes(matrix);
+    }
+
+    public void setZeroes(int[][] matrix)
+    {
+        Set<Integer> row = new HashSet<>();
+        Set<Integer> col = new HashSet<>();
+        int m = matrix.length;
+        int n = matrix[0].length;
+        for(int i = 0; i < m; i ++)
+        {
+            for(int j = 0; j < n; j ++)
+            {
+                if(matrix[i][j] == 0)
+                {
+                    row.add(i);
+                    col.add(j);
+                }
+            }
+        }
+
+        for(int r : row)
+        {
+            for(int j = 0; j < n; j++)
+            {
+                matrix[r][j] = 0;
+            }
+        }
+
+        for(int c : col)
+        {
+            for(int i = 0; i < m; i++)
+            {
+                matrix[i][c] = 0;
+            }
+        }
+    }
+}

problems/src/ThirdMaximumNumber.java

@@ -1,5 +1,3 @@
-import com.sun.tools.internal.ws.wsdl.document.soap.SOAPUse;
-
 /**
  * Created by gouthamvidyapradhan on 25/03/2017.
  * Accepted