Soduku Solver

SodukuSolver.js

const solveSudoku = (grid, level) => {
    let tries = 0;
    // solve : (number[][], number, number)=> boolean
    const solve = (grid, r, c) => {
        if (c === level * level) {
            r++;
            c = 0;
            if (r === level * level) return true;
        }

        if (grid[r][c] !== '.') return solve(grid, r, c + 1);

        let solved = false;
        const candidates = getPossibleNumsForACell(grid, r, c, level);
        for (let n of candidates) {
            tries++;
            grid[r][c] = n;
            solved = solve(grid, r, c + 1);
            if (solved) break;
            grid[r][c] = '.';
        }
        return solved;
    };
    solve(grid, 0, 0);
    console.log(tries);
};