How should I practice Largest Square of Ones?

Start by reading the full statement, solve the visible examples, then compare the pattern against related OpenAI online assessment problems in FastPrep.

Is Largest Square of Ones associated with OpenAI?

FastPrep tags this as a OpenAI online assessment coding practice problem when the problem catalog has that company and stage context.

Largest Square of Ones

OpenAI● MediumFULLTIMEOA

Learn

Problem statement

Given a rectangular binary matrix matrix, return the side length of the largest square submatrix composed only of 1 values.

If the matrix contains no 1, return 0.

Function

findLargestSquare(matrix: int[][]) → int

Examples

Example 1

matrix = [[1,1,0,1,0],[1,1,1,1,1],[0,0,1,1,1],[0,0,1,1,1],[1,1,0,0,0]]return = 3

The rows and columns from index 1 through 3 contain a 3 x 3 square of ones.

Example 2

matrix = [[0,0],[0,0]]return = 0

No cell contains 1.

Example 3

matrix = [[1]]return = 1

The single cell is itself a square of side length 1.

Constraints

1 <= matrix.length <= 500.
1 <= matrix[i].length <= 500.
Every row has the same length.
Every value is either 0 or 1.