From 0f0146edb89c99a75d5184c8cff99a4dc9dd12e6 Mon Sep 17 00:00:00 2001 From: Ayushi Tiwari Date: Fri, 14 Jan 2022 13:40:41 +0530 Subject: [PATCH] Create Valid-Sudoku --- Valid-Sudoku | 39 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 Valid-Sudoku diff --git a/Valid-Sudoku b/Valid-Sudoku new file mode 100644 index 0000000..b368a6c --- /dev/null +++ b/Valid-Sudoku @@ -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 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; + + + } +}