Question

Problem 4 Given an n * n binary matrix M (each entry of the matrix is 0 or 1), find the largest square containing only 0s and return it. (That is, return (i, j, k) where $\forall i \le x \le i + k$ $\forall j \le y \le j + k$ $M[x, y] = 0$ and k is maximum.) Your algorithm should work in O(n²).

          Problem 4
Given an n * n binary matrix M (each entry of the matrix is 0 or 1), find the largest square
containing only 0s and return it. (That is, return (i, j, k) where
$\forall i \le x \le i + k$ $\forall j \le y \le j + k$ $M[x, y] = 0$
and k is maximum.) Your algorithm should work in O(n²).

Problem 4
Given an n * n binary matrix M (each entry of the matrix is 0 or 1), find the largest square
containing only 0s and return it. (That is, return (i, j, k) where
∀ i ≤ x ≤ i + k ∀ j ≤ y ≤ j + k M[x, y] = 0
and k is maximum.) Your algorithm should work in O(n²).

Added by Miriam C.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Madhur L

05/15/2023

Step 1

We will create a 2D array dp of size n x n, where dp[i][j] represents the size of the largest square with bottom-right corner at (i, j) that contains only 0s. Show more…

Show all steps

Thanks for your feedback!

Problem 4 Given an n * n binary matrix M (each entry of the matrix is 0 or 1), find the largest square containing only 0s and return it. (That is, return (i, j, k) where $$\forall i \le x \le i + k \ \forall j \le y \le j + k \ M[x, y] = 0$$ and k is maximum.) Your algorithm should work in O(n²).