Latin squares count
Count the number of n x n Latin squares: grids filled with values 1..n such that every row and every column contains each value exactly once. Return the count. 1 <= n <= 4 (the count grows extremely fast).
Implement
count_latin_squares(n: int) → intExamples
in
[3]out12What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
[3]12not run yetsample