Function solveNQueens

javascript/0051-n-queens.js:7–16

* https://leetcode.com/problems/n-queens/ * Time O(N!) | Space O(N^2) * @param {number} n * @return {string[][]}

(
    n,
    colSet = new Set(),
    posDiagSet = new Set(),
    negDiagSet = new Set(),
)

 * @return {string[][]}
 */
function solveNQueens(
    n,
    colSet = new Set(),
    posDiagSet = new Set(),
    negDiagSet = new Set(),
) {
    const board = new Array(n).fill().map(() => new Array(n).fill('.'));

    return dfs(board, n, colSet, posDiagSet, negDiagSet);
}

const dfs = (board, n, colSet, posDiagSet, negDiagSet, row = 0, moves = []) => {
    const isBaseCase = row === n;