class Solution:
def isValidSudoku(self, board: List[List[str]]) -> bool:
a = [0, 3, 6, 9]
b = [0, 3, 6, 9]
for count in range(3):
for count2 in range(3):
arr = [-1] * 10
for i in range(a[count], a[count+1]):
for j in range(b[count2], b[count2+1]):
if board[i][j] == ".":
continue
else:
if arr[int(board[i][j])] != -1:
return False
else:
arr[int(board[i][j])] = 1
for i in range(9):
k = {}
for j in range(9):
if board[i][j] == ".":
continue
if board[i][j] in k:
return False
else:
k[board[i][j]] = 1
for j in range(9):
k = {}
for i in range(9):
if board[i][j] == ".":
continue
if board[i][j] in k:
return False
else:
k[board[i][j]] = 1
return True
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |