PQ #4 - N Queens Problem using Backtracking | Easiest Solution REVEALED !!

[@dragonhot6951]

ohh wow straight abd understandable and clear code no mess

[@mohamedazizjnayah1789]

thank you Very good explanation😊, we need more videos

[@InterviewWithBunny]

Thank you, I will

[@sanketghosh9184]

Daarun hyeche dada ❤️❤️

[@InterviewWithBunny]

thank you

[@BhaumikLodhia]

Very good explanation !!

[@Ishnavvulu]

Very good explanation😊

[@vijayakumarm5476]

Super explanation brother thanks❤🙏

[@InterviewWithBunny]

Welcome 👍

[@tannubajpai4782]

Welcome back buddy

[@InterviewWithBunny]

Thank you

[@bhagyaagasar6193]

can you provide of N-queen problem video ppt..please if possible

[@praveens4352]

thank you so much bro

[@yarramneninikhil1299]

Bro how to master dsa please provide me roadmap and resources

[@InterviewWithBunny]

there is no other option than practice...

[@madhuribende9974]

Tell explanation that how they can't get attacked

[@akashchhabria5637]

Solution for the leetcode problem:(I removed the row check loop) class Solution {
public boolean isSafe(char[][] chessBoard, int row , int column, int n) {
for(int i = 0; i < row; i++){
if(chessBoard[i][column] == 'Q') return false;
}
for(int i = row - 1 ,j = column - 1 ; i >=0 && j>=0;i-- , j--){
if(chessBoard[i][j] == 'Q') return false;
}
for(int i = row - 1 ,j = column + 1 ; i >=0 && j < n;i-- , j++){
if(chessBoard[i][j] == 'Q') return false;
}
return true;
}
public List constructBoard(char[][] chessBoard,int n){
List Board = new ArrayList();
for(int i = 0; i < n; i++){
Board.add(new String(chessBoard[i]));
}
return Board;
}
public List solveNQueens(int n) {
List result = new ArrayList();
char[][] chessBoard = new char[n][n];
for(int i = 0; i < n; i++){
Arrays.fill(chessBoard[i] , '.');
}
solve(0, chessBoard, result, n);
return result;
}
public void solve(int row, char[][] chessBoard , List result, int n ){
if (row == n) {
result.add(constructBoard(chessBoard, n));
return;
}
for(int column = 0; column < n; column++){
if(isSafe(chessBoard, row, column, n)){
chessBoard[row][column] = 'Q';
solve(row + 1, chessBoard, result, n);
chessBoard[row][column] = '.';
}
}
}
}

[@sairaju4984]

❤❤❤