




First nine lines of input contain N(=9) space-separated integers, representing elements of 2D array ARR.
For each test case, return the solution of sudoku.
You do not need to print anything; it has already been taken care of. Just implement the given function.
The system will print ‘CORRECT SOLUTION’ if your solution to sudoku is correct, ‘INCORRECT SOLUTION’ otherwise.
N = 9
0<= ARR[i][j] <=9
Time Limit: 1 second
Our approach here will be to check for each empty slot that filling it with which number will not violate any constraint. We will start from the first block and keep on checking for each block using recursion. Consider a function SOLVESUDOKU for this, that accepts as a parameter an ArrayList ARR and do:
To check if it is safe to place any value at an index, we use function ISSAFE that accepts ArrayList ARR, integer VAL, integer ROW and integer COLUMN as parameters and do:
Combination Sum III
Combination Sum III
Combination Sum III
Combination Sum III
Combination Sum III
Generate All Strings
Generate All Strings
Generate All Strings
Generate All Strings
8-Queen Problem
Sequential Digits
Expression Add Operators