The Runtime Theory
mediumLeetCode#sets#grid-invariants

Valid Sudoku

Check whether the filled cells violate any row, column, or 3-by-3 box uniqueness rule; empty cells are ignored.

The Runtime Theory Team25 min read
Solve it

Solving happens on the judge — come back and mark it done

Sample cases

inboard=["53..7....","6..195...",".98....6.","8...6...3","4..8.3..1","7...2...6",".6....28.","...419..5","....8..79"]

outtrue

inboard with two 5 values in one row

outfalse

in9-by-9 empty board

outtrue

Check whether the filled cells violate any row, column, or 3-by-3 box uniqueness rule; empty cells are ignored.

A good solution should

  • State the invariant or decision rule that makes the approach correct.
  • Explain the time and space complexity in terms of the input sizes and required output.
  • Handle empty, minimal, duplicate, and boundary-shaped inputs covered by the contract.

Reasoning prompt

Validate each constraint independently and avoid treating the puzzle’s eventual solvability as part of this check.

Use the linked judge for the canonical problem. The examples above are compact TRT checks; write additional cases before submitting, especially for the boundary that tends to break your chosen invariant.

More practice in this topic

One dispatch a week

The trace behind each problem, the tradeoff that explains it, and one technical dispatch per week — no noise.

One technical dispatch per week. No noise.

Not started

Sign in to save your learning progress.

Sign in to save