add LearningChess solution

Author: jakovmitrovski

easy200/LearningChess.java

@@ -0,0 +1,45 @@
+package easy200;
+
+import java.util.Arrays;
+
+public class LearningChess {
+    public int numberOfMoves(String knight, String[] pieces) {
+
+        boolean[][] visited = new boolean[8][8];
+
+        for (int i = 0; i < pieces.length; i++) {
+            int row = Integer.parseInt(String.valueOf(pieces[i].charAt(1))) - 1;
+            int col = Integer.parseInt(String.valueOf(pieces[i].charAt(0) - 'a'));
+            if (pieces[i].charAt(2) == knight.charAt(2))
+                visited[row][col] = true;
+        }
+
+        int kr = Integer.parseInt(String.valueOf(knight.charAt(1))) - 1;
+        int kc = Integer.parseInt(String.valueOf(knight.charAt(0) - 'a'));
+
+        int ret = 0;
+        if (kr - 2 >= 0 && kc + 1 < 8 && !visited[kr - 2][kc + 1])
+            ret++;
+        if (kr - 2 >= 0 && kc - 1 >= 0 && !visited[kr - 2][kc - 1])
+            ret++;
+        if (kr - 1 >= 0 && kc + 2 < 8 && !visited[kr - 1][kc + 2])
+            ret++;
+        if (kr - 1 >= 0 && kc - 2 >= 0 && !visited[kr - 1][kc - 2])
+            ret++;
+        if (kr + 1 < 8 && kc + 2 < 8 && !visited[kr + 1][kc + 2])
+            ret++;
+        if (kr + 1 < 8 && kc - 2 >= 0 && !visited[kr + 1][kc - 2])
+            ret++;
+        if (kr + 2 < 8 && kc + 1 < 8 && !visited[kr + 2][kc + 1])
+            ret++;
+        if (kr + 2 < 8 && kc - 1 >= 0 && !visited[kr + 2][kc - 1])
+            ret++;
+
+        return ret;
+    }
+
+    public static void main(String[] args) {
+        LearningChess l = new LearningChess();
+        System.out.println(l.numberOfMoves("g8b", new String[] { "a3w", "f4w", "e3b" }));
+    }
+}