Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Largest All-Ones Square

Largest All-Ones Square

Difficulty: 1600 3000 ms 128 MB

dp

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

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen