style: apply clang-format fixes and add newline at end of files

Author: the-Sunny-Sharma

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

@@ -71,15 +71,7 @@ public static List<String> findPaths(final int[][] maze) {
      * @param visited tracks visited cells for the current path
      * @param results accumulates complete paths
      */
-    private static void solve(
-            final int[][] maze,
-            final int row,
-            final int col,
-            final int n,
-            final String path,
-            final boolean[][] visited,
-            final List<String> results) {
-
+    private static void solve(final int[][] maze, final int row, final int col, final int n, final String path, final boolean[][] visited, final List<String> results) {
         // Base case: reached destination
         if (row == n - 1 && col == n - 1) {
             results.add(path);
@@ -121,17 +113,7 @@ private static void solve(
      * @param visited tracks visited cells for the current path
      * @return {@code true} if the cell is within bounds, open, and not yet visited
      */
-    private static boolean isSafe(
-            final int[][] maze,
-            final int row,
-            final int col,
-            final int n,
-            final boolean[][] visited) {
-        return row >= 0
-                && row < n
-                && col >= 0
-                && col < n
-                && maze[row][col] == 1
-                && !visited[row][col];
+    private static boolean isSafe(final int[][] maze, final int row, final int col, final int n, final boolean[][] visited) {
+        return row >= 0 && row < n && col >= 0 && col < n && maze[row][col] == 1 && !visited[row][col];
     }
-}
+}

src/test/java/com/thealgorithms/backtracking/RatInAMazeTest.java

@@ -11,15 +11,9 @@ class RatInAMazeTest {
 
     @Test
     void testMultiplePathsExist() {
-        // This maze has exactly 2 paths: DDRDRR and DRDDRR
-        int[][] maze = {
-                {1, 0, 0, 0},
-                {1, 1, 0, 1},
-                {0, 1, 0, 0},
-                {0, 1, 1, 1}
-        };
+        int[][] maze = {{1, 0, 0, 0}, {1, 1, 0, 1}, {0, 1, 0, 0}, {0, 1, 1, 1}};
+
         List<String> paths = RatInAMaze.findPaths(maze);
-        // Verify at least one valid path exists and all paths are valid
         assertTrue(paths.size() >= 1);
         for (String path : paths) {
             assertTrue(path.chars().allMatch(c -> "DLRU".indexOf(c) >= 0));
@@ -28,43 +22,29 @@ void testMultiplePathsExist() {
 
     @Test
     void testSinglePath() {
-        int[][] maze = {
-                {1, 0, 0},
-                {1, 1, 0},
-                {0, 1, 1}
-        };
+        int[][] maze = {{1, 0, 0}, {1, 1, 0}, {0, 1, 1}};
         List<String> paths = RatInAMaze.findPaths(maze);
         assertEquals(1, paths.size());
         assertEquals("DRDR", paths.get(0));
     }
 
     @Test
     void testNoPathExists() {
-        int[][] maze = {
-                {1, 0, 0},
-                {0, 0, 0},
-                {0, 0, 1}
-        };
+        int[][] maze = {{1, 0, 0}, {0, 0, 0}, {0, 0, 1}};
         List<String> paths = RatInAMaze.findPaths(maze);
         assertTrue(paths.isEmpty());
     }
 
     @Test
     void testSourceBlocked() {
-        int[][] maze = {
-                {0, 1},
-                {1, 1}
-        };
+        int[][] maze = {{0, 1}, {1, 1}};
         List<String> paths = RatInAMaze.findPaths(maze);
         assertTrue(paths.isEmpty());
     }
 
     @Test
     void testDestinationBlocked() {
-        int[][] maze = {
-                {1, 1},
-                {1, 0}
-        };
+        int[][] maze = {{1, 1}, {1, 0}};
         List<String> paths = RatInAMaze.findPaths(maze);
         assertTrue(paths.isEmpty());
     }
@@ -91,7 +71,7 @@ void testNullMazeThrowsException() {
 
     @Test
     void testEmptyMazeThrowsException() {
-        assertThrows(IllegalArgumentException.class, () -> RatInAMaze.findPaths(new int[][]{}));
+        assertThrows(IllegalArgumentException.class, () -> RatInAMaze.findPaths(new int[][] {}));
     }
 
     @Test
@@ -102,28 +82,19 @@ void testNonSquareMazeThrowsException() {
 
     @Test
     void testAllCellsOpen() {
-        int[][] maze = {
-                {1, 1, 1},
-                {1, 1, 1},
-                {1, 1, 1}
-        };
+        int[][] maze = {{1, 1, 1}, {1, 1, 1}, {1, 1, 1}};
         List<String> paths = RatInAMaze.findPaths(maze);
         assertTrue(paths.size() > 1);
     }
 
     @Test
     void testLargerMazeWithPath() {
-        int[][] maze = {
-                {1, 1, 1, 1},
-                {0, 1, 0, 1},
-                {0, 1, 0, 1},
-                {0, 1, 1, 1}
-        };
+        int[][] maze = {{1, 1, 1, 1}, {0, 1, 0, 1}, {0, 1, 0, 1}, {0, 1, 1, 1}};
         List<String> paths = RatInAMaze.findPaths(maze);
         assertTrue(paths.size() >= 1);
         for (String path : paths) {
-            assertTrue(path.chars().allMatch(c -> "DLRU".indexOf(c) >= 0),
-                    "Path contains invalid characters: " + path);
+            assertTrue(path.chars().allMatch(c -> "DLRU".indexOf(c) >= 0), "Path contains invalid characters: " + path);
         }
+
     }
-}
+}