175. Maximal Square
MediumDynamic Programming
Given an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.
Examples
Input: [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]
Output: 4
Explanation: The largest all-ones square has side 2, area 4.
Constraints
- m == matrix.length
- n == matrix[i].length
- 1 <= m, n <= 300
- matrix[i][j] is '0' or '1'.
Loading...
Run checks all cases above. Submit evaluates all test cases.