We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent ed3fa77 commit fd88133Copy full SHA for fd88133
LeetCode/221/README.md
@@ -0,0 +1,6 @@
1
+# [LeetCode-221](https://leetcode.com/problems/maximal-square/): Minimal Square Problem
2
+
3
+### Instinct:
4
+1) Linear search the array (matrix) for max square size if square sizes are already available on every cell. This is O(n) operation where n=row*col.
5
+2) Augment the array to store the adjacent following square sizes too.
6
0 commit comments