applied clang format

Author: Darshan-Baligeri

src/main/java/com/thealgorithms/backtracking/CrosswordSolver.java

@@ -104,7 +104,7 @@ public static boolean solveCrossword(char[][] puzzle, Collection<String> words)
             for (int col = 0; col < puzzle[0].length; col++) {
                 if (puzzle[row][col] == ' ') {
                     for (String word : new ArrayList<>(remainingWords)) {
-                        for (boolean vertical : new boolean[]{true, false}) {
+                        for (boolean vertical : new boolean[] {true, false}) {
                             if (isValid(puzzle, word, row, col, vertical)) {
                                 placeWord(puzzle, word, row, col, vertical);
                                 remainingWords.remove(word);

src/main/java/com/thealgorithms/backtracking/KnightsTour.java

@@ -25,14 +25,14 @@ private KnightsTour() {
 
     // Possible moves for a knight in chess
     private static final int[][] MOVES = {
-            {1, -2},
-            {2, -1},
-            {2, 1},
-            {1, 2},
-            {-1, 2},
-            {-2, 1},
-            {-2, -1},
-            {-1, -2},
+        {1, -2},
+        {2, -1},
+        {2, 1},
+        {1, 2},
+        {-1, 2},
+        {-2, 1},
+        {-2, -1},
+        {-1, -2},
     };
 
     // Chess grid representing the board
@@ -109,7 +109,7 @@ static List<int[]> neighbors(int row, int column) {
             int y = m[1];
             if (row + y >= 0 && row + y < BASE && column + x >= 0 && column + x < BASE && grid[row + y][column + x] == 0) {
                 int num = countNeighbors(row + y, column + x);
-                neighbour.add(new int[]{row + y, column + x, num});
+                neighbour.add(new int[] {row + y, column + x, num});
             }
         }
         return neighbour;