LeetCode Q221: Maximal Square

Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.

For example, given the following matrix:

1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0

Return 4.

Solution:
DP, at each entry, need to check its left, up and upleft entries. Add one to the smallest entry of the three. If current entry is 0, then keep as it is.



Round 2 solution: