-
Notifications
You must be signed in to change notification settings - Fork 119
/
Copy pathValid Sudoku.py
64 lines (44 loc) · 1.68 KB
/
Valid Sudoku.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
# Runtime: 104 ms (Top 89.12%) | Memory: 14 MB (Top 35.48%)
class Solution:
def isValidSudoku(self, board: List[List[str]]) -> bool:
hrow = {}
hcol = {}
hbox = defaultdict(list)
#CHECK FOR DUPLICATES ROWWISE
for i in range(9):
for j in range(9):
#JUST THAT THE DUPLICATE SHOULDNT BE ","
if board[i][j] != '.':
if board[i][j] not in hrow:
hrow[board[i][j]] = 1
else:
return False
#CLEAR HASHMAP FOR THIS ROW
hrow.clear()
print("TRUE1")
#CHECK FOR DUPLICATES COLUMNWISE
for i in range(9):
for j in range(9):
#JUST THAT THE DUPLICATE SHOULDNT BE ","
if board[j][i] != '.':
if board[j][i] not in hcol:
hcol[board[j][i]] = 1
else:
return False
#CLEAR HASHMAP FOR THIS COL
hcol.clear()
print('TRUE2')
#CHECK DUPLICATE IN BOX, THIS IS WHERE KEY DESIGN SKILLS COME INTO PLAY, FOR SUDOKU YOU COMBINE ROW INDICES AND COL INDICES
for i in range(9):
for j in range(9):
i_3 = i //3
j_3 = j//3
# print(hbox)
if board[i][j] != '.':
#CHECK ELEMENT OF ORIGINAL INDICE present in key i_3 , j_3
if board[i][j] not in hbox[i_3 , j_3]:
# #CHECKED IN NEW KEY
hbox[i_3 ,j_3 ]= hbox[i_3 ,j_3 ] + [board[i][j]]
else:
return False
return True