From 20ffcae264e004327415c297762a28ea8d7a6aef Mon Sep 17 00:00:00 2001 From: Dipit12 Date: Sun, 19 Oct 2025 18:09:56 +0530 Subject: [PATCH] feat: added NQueens solution in java --- Java/algorithms/matrix/NQueens.java | 51 +++++++++++++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 Java/algorithms/matrix/NQueens.java diff --git a/Java/algorithms/matrix/NQueens.java b/Java/algorithms/matrix/NQueens.java new file mode 100644 index 00000000..dd0594a6 --- /dev/null +++ b/Java/algorithms/matrix/NQueens.java @@ -0,0 +1,51 @@ +package Java.algorithms.matrix; + +import java.util.*; + +public class NQueens { + static List> res = new ArrayList<>(); + + public static List> solveNQueens(int n) { + char[][] board = new char[n][n]; + for (char[] row : board) Arrays.fill(row, '.'); + solve(board, 0); + return res; + } + + static void solve(char[][] board, int row) { + if (row == board.length) { + List temp = new ArrayList<>(); + for (char[] r : board) temp.add(new String(r)); + res.add(temp); + return; + } + for (int col = 0; col < board.length; col++) { + if (isSafe(board, row, col)) { + board[row][col] = 'Q'; + solve(board, row + 1); + board[row][col] = '.'; + } + } + } + + static boolean isSafe(char[][] board, int row, int col) { + for (int i = 0; i < row; i++) + if (board[i][col] == 'Q') return false; + + for (int i = row - 1, j = col - 1; i >= 0 && j >= 0; i--, j--) + if (board[i][j] == 'Q') return false; + + for (int i = row - 1, j = col + 1; i >= 0 && j < board.length; i--, j++) + if (board[i][j] == 'Q') return false; + + return true; + } + + public static void main(String[] args) { + List> solutions = solveNQueens(4); + for (List s : solutions) { + for (String row : s) System.out.println(row); + System.out.println(); + } + } +}