Validate Sudoku with Complexity

MediumPython

Problem

Code a solution to validate a Sudoku board and explain its time complexity.

Implement validate_sudoku(board), where board is a 9x9 list of strings. Each cell contains a digit from "1" to "9" or "." for empty. Return True if no digit is repeated within any row, column, or 3x3 sub-box; otherwise return False. The board does not need to be solvable or completely filled.

Constraints

board has exactly 9 rows and 9 columns
Each cell is a digit from "1" to "9" or "."
A board only needs to satisfy validation rules, not be solvable
Each digit must be unique within its row, column, and 3x3 sub-box

Function Signature

def validate_sudoku(board):

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.