And also can solving using the getCandidates, which is more efficient (O(nlog n), backtracking has O(9^nn)
You don't have to do backtracking, you can solve it with a direct algorithm.
This comment is hidden because it contains spoiler information about the solution
Loading collection data...
And also can solving using the getCandidates, which is more efficient (O(nlog n), backtracking has O(9^nn)
You don't have to do backtracking, you can solve it with a direct algorithm.
This comment is hidden because it contains spoiler information about the solution