How should I practice Validate a Latin Square?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Validate a Latin Square associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Validate a Latin Square

Google● MediumINTERNONSITE INTERVIEW

Problem statement

You are given an n by n integer matrix. A Latin square contains every integer from 1 through n exactly once in each row and exactly once in each column.

Return true if the matrix is a Latin square, otherwise return false. Diagonals have no additional requirement.

Function

isLatinSquare(matrix: int[][]) → boolean

Examples

Example 1

matrix = [[1,2,3],[2,3,1],[3,1,2]]return = true

Each row and each column contains 1, 2, and 3 exactly once.

Example 2

matrix = [[1,2],[1,2]]return = false

Both rows contain the required values, but each column repeats a value.

Example 3

matrix = [[2]]return = false

A Latin square of size 1 must contain 1.

Constraints

1 <= n == matrix.length <= 200.
Every row has exactly n elements.
-10^9 <= matrix[i][j] <= 10^9.