Sudoku is a logic-based, combinatorial number-placement puzzle. In classic Sudoku, the objective is to fill a 9 × 9 grid with digits so that each column, each row, and each of the nine 3 × 3 subgrids that compose the grid contain all of the digits from 1 to 9.

Here, I've devised a backtracking algorithm which computes the Solution of this 9x9 Sudoku Puzzle. I've performed time complexity optimizations using auxillary space which checks if we can palce a number at a vacant place in O(1) time complexity The worst case time complexity of the whole solution is O(9^(NN)) where N is also 9 in case of sudoku Space Complexity: O(3N*N)