221. Maximal Square

by

Duct Tape Programmer


Question

Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 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.

Quick Hints

  • Use memoization to calculate

Solution

Time complexity

O (m * n)

Space complexity

O (n) for memoization

Notes

comments powered by Disqus