Back to DSA sheet

Maximal Square

MediumDynamic Programming
Open on LeetCodeAmazonGoogleMeta

Find the area of the largest square containing only 1s in a binary matrix.

Constraints
  • 1 <= m, n <= 300
  • matrix[i][j] is '0' or '1'
Sheets
Blind 75Grind 75NeetCode 150NeetCode 250
maximal-square.cpp
Loading editor
Custom input (stdin)
Output

Run your code to see its output.