Leetcode 221. Maximal Square

Given an m×n binary matrix, find the area of the largest axis-aligned square submatrix that contains only '1's. This is a classic DP problem (m,n ≤ 300) of computing the maximal square size at each cell and returning its area.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 221. Maximal Square

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact