Quote Originally Posted by ElemenT.usha View Post
it si a sudoku program....
i.e, it takes a 9x9 sparse array... and inputs for the array...

using the rules it has to output the solution....
RULES:
1.no element can repeat itself in a row.
2.no element can repeat itself in the column.
3.all elements 1-9 should be present in every row n column....
You are missing an important rule...

Each 3x3 sub grid should contain all elements 1-9

otherwise, this would be valid, shift position by 1 each row like:

123456789
234567891
345678912
456789123
567891234
678912345
789123456
891234567
912345678

Here is a solver I wrote a while back