<p>The <strong>n-queens</strong> puzzle is the problem of placing <code>n</code> queens on an <code>n x n</code> chessboard such that no two queens attack each other.</p>

<p>Given an integer <code>n</code>, return <em>the number of distinct solutions to the&nbsp;<strong>n-queens puzzle</strong></em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/13/queens.jpg" style="width: 600px; height: 268px;" />
<pre>
<strong>Input:</strong> n = 4
<strong>Output:</strong> 2
<strong>Explanation:</strong> There are two distinct solutions to the 4-queens puzzle as shown.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 1
<strong>Output:</strong> 1
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 9</code></li>
</ul>

class Solution {
public:
    bool isValidPos(int i,int j, vector<vector<int>> vec){
        int rr = i , cc = j;
        while(rr>=0){
            if(vec[rr--][j] == 1) return false;
        }
        rr = i;
        while(rr >=0 && cc >=0){
            if(vec[rr--][cc--] == 1) return false;
        }
        while(i>=0 && j<vec.size()){
            if(vec[i--][j++] == 1) return false;
        }

        return true;
    }
    void nQueen(int idx , vector< bool > &column , vector<vector< int >>&board , int &res ){
        if(idx >= board.size()){
            res += 1;
            return;
        }
        for(int i=0 ; i<board.size() ; i++){
            if( column[i] == false && isValidPos(idx , i , board)){
                board[idx][i] = 1;
                column[i] = true;
                nQueen( idx+1 , column , board , res );
                column[i] = false;
                board[idx][i] = 0;
            }
        }
    }
    int totalNQueens(int n) {
        int res = 0;
        vector< vector<int>> vec( n , vector<int>(n , 0));
        vector< bool >column( n , false);
        nQueen( 0 , column , vec , res);
        return res;
    }
};
        // vector< vector<int>>vec = {
        //     { 0, 0, 0, 1},
        //     { 1, 0, 0, 0},
        //     { 1, 0, 0, 0},
        //     { 0, 0, 0, 0}
        // };
        // cout << isValidPos(1,2,vec) << endl;
40317