Function dfs

javascript/0051-n-queens.js:18–39

(board, n, colSet, posDiagSet, negDiagSet, row = 0, moves = [])

}

const dfs = (board, n, colSet, posDiagSet, negDiagSet, row = 0, moves = []) => {
    const isBaseCase = row === n;
    if (isBaseCase) {
        const rows = board.map((_row) => _row.join(''));

        moves.push(rows);

        return moves;
    }

    for (let col = 0; col < n; col++) {
        const hasQueen =
            colSet.has(col) ||
            posDiagSet.has(row + col) ||
            negDiagSet.has(row - col);
        if (hasQueen) continue;

        backTrack(board, n, row, col, colSet, posDiagSet, negDiagSet, moves);
    }

    return moves;
};

const backTrack = (
    board,