Skip to content

Commit fd88133

Browse files
committed
array-lc-221: Introduced README fo rthe problem
1 parent ed3fa77 commit fd88133

File tree

1 file changed

+6
-0
lines changed

1 file changed

+6
-0
lines changed

LeetCode/221/README.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -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

Comments
 (0)