Skip to content

Commit

Permalink
Create Valid-Sudoku
Browse files Browse the repository at this point in the history
  • Loading branch information
1610ayushi authored Jan 14, 2022
1 parent 078f36d commit 0f0146e
Showing 1 changed file with 39 additions and 0 deletions.
39 changes: 39 additions & 0 deletions Valid-Sudoku
Original file line number Diff line number Diff line change
@@ -0,0 +1,39 @@
Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

Each row must contain the digits 1-9 without repetition.
Each column must contain the digits 1-9 without repetition.
Each of the nine 3 x 3 sub-boxes of the grid must contain the digits 1-9 without repetition.
Note:

A Sudoku board (partially filled) could be valid but is not necessarily solvable.
Only the filled cells need to be validated according to the mentioned rules.

Input: board =
[["5","3",".",".","7",".",".",".","."]
,["6",".",".","1","9","5",".",".","."]
,[".","9","8",".",".",".",".","6","."]
,["8",".",".",".","6",".",".",".","3"]
,["4",".",".","8",".","3",".",".","1"]
,["7",".",".",".","2",".",".",".","6"]
,[".","6",".",".",".",".","2","8","."]
,[".",".",".","4","1","9",".",".","5"]
,[".",".",".",".","8",".",".","7","9"]]
Output: true

class Solution {
public boolean isValidSudoku(char[][] board) {
HashSet<String> seen= new HashSet();
for(int i =0;i<9;i++){
for(int j=0;j<9;j++){
char Current_value = board[i][j];
if(Current_value != '.'){
if(!seen.add(Current_value +"found in row"+i) || !seen.add(Current_value+"found in column"+j) || !seen.add(Current_value +"found in sub box"+i/3+ j/3))
return false;
}
}
}
return true;


}
}

0 comments on commit 0f0146e

Please sign in to comment.