Tap here to switch tabs
Problem
Submissions

Problem: Maximal Square

Maximal Square asks you to find the largest square of 1s within a binary matrix and return its area. The square must be filled entirely with 1s.

Statement

Given a m×nm × n binary matrix, filled with 0′s0's and 1′s1's. Your task is to find the largest possible square composed entirely of cells with value 11, and return the area of that square.

Constraints:

  • m==m == matrix.length

  • n==n == matrix[i].length

  • 1<=m,n<=3001 <=m, n <= 300

  • matrix[i][j] is 00 or 11.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Maximal Square

Maximal Square asks you to find the largest square of 1s within a binary matrix and return its area. The square must be filled entirely with 1s.

Statement

Given a m×nm × n binary matrix, filled with 0′s0's and 1′s1's. Your task is to find the largest possible square composed entirely of cells with value 11, and return the area of that square.

Constraints:

  • m==m == matrix.length

  • n==n == matrix[i].length

  • 1<=m,n<=3001 <=m, n <= 300

  • matrix[i][j] is 00 or 11.