Programming, Sudoku, Python3, Backtracking, Search.
the best one is O(9n), where n is the number of total empty spots. The total time complexity is O(n²). Compared with the time complexity of cⁿ, where c is the average number of candidate for each spot, the time spent here is trivial. In this problem, backtrack happens if the current path can not