Remove unused fields and comments.

Author: Maryamh12

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

@@ -35,9 +35,6 @@
  *  - Stack space for the recursive DFS function, where L is the maximum depth of recursion (length of the word).
  */
 public class WordSearch {
-//    private final int[] dx = {0, 0, 1, -1, 2, -2};
-//    private final int[] dy = {1, -1, 0, 0};
-//    private boolean[][] visited;
     private char[][] board;
     private String word;
 
@@ -58,29 +55,9 @@ private boolean isValid(int x, int y) {
      *
      * @param x       The current row index.
      * @param y       The current column index.
-     * @param nextIdx The index of the next character in the word to be matched.
+     * @param idx The index of the next character in the word to be matched.
      * @return True if a valid path is found to match the remaining characters of the word; false otherwise.
      */
-    //    private boolean doDFS(int x, int y, int nextIdx) {
-    //        visited[x][y] = true;
-    //        if (nextIdx == word.length()) {
-    //            return true;
-    //        }
-    //
-    //        for (int i = 0; i < 4; ++i) {
-    //            int xi = x + dx[i];
-    //            int yi = y + dy[i];
-    //            if (isValid(xi, yi) && board[xi][yi] == word.charAt(nextIdx) && !visited[xi][yi]) {
-    //                boolean exists = doDFS(xi, yi, nextIdx + 1);
-    //                if (exists) {
-    //                    return true;
-    //                }
-    //            }
-    //        }
-    //
-    //        visited[x][y] = false; // Backtrack
-    //        return false;
-    //    }
 
     private boolean dfs(char[][] board, int x, int y, String word, int idx) {
         if (idx == word.length()) {
@@ -109,22 +86,6 @@ private boolean dfs(char[][] board, int x, int y, String word, int idx) {
      * @param word  The target word to search for in the board.
      * @return True if the word exists in the board; false otherwise.
      */
-    //    public boolean exist(char[][] board, String word) {
-    //        this.board = board;
-    //        this.word = word;
-    //        for (int i = 0; i < board.length; ++i) {
-    //            for (int j = 0; j < board[0].length; ++j) {
-    //                if (board[i][j] == word.charAt(0)) {
-    //                    visited = new boolean[board.length][board[0].length];
-    //                    boolean exists = doDFS(i, j, 1);
-    //                    if (exists) {
-    //                        return true;
-    //                    }
-    //                }
-    //            }
-    //        }
-    //        return false;
-    //    }
 
     public boolean exist(char[][] board, String word) {