Problem Description
Given a 2D binary matrix A of size N x M
find the area of maximum size square sub-matrix with all 1's.
1 <= N, M <= 103
A[i][j] = 1 or A[i][j] = 0
First argument is an 2D matrix A of size N x M
.
Output the area of maximum size square sub-matrix in A with all 1's.
Input 1:
A = [
[0, 1, 1, 0, 1],
[1, 1, 0, 1, 0],
[0, 1, 1, 1, 0],
[1, 1, 1, 1, 0],
[1, 1, 1, 1, 1],
[0, 0, 0, 0, 0] ]
Input 2:
A = [
[1, 1], [1, 1] ]
Output 1:
9
Output 2:
4
Explanation 1:
Consider the below binary matrix. The area of the square is 3 * 3 = 9
Explanation 2:
The given matrix is the largest size square possible so area will be 2 * 2 = 4
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.