Largest All-Ones Square
In a binary grid, find the side length of the largest square consisting entirely of 1s.
Input: the first line has N and M; the next N lines each have M characters (0/1).
Output: the side of the largest all-ones square.
Constraints:
- 1 ≤ N, M ≤ 1000
Sample Tests
Input 1
4 5 10111 10111 11111 10010
Output 1
3
Input 2
1 1 0
Output 2
0
Discussion (opens after you solve — no spoilers before)
No comments yet.