![Cover image for [Devmates.co] Square Area](https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fthepracticaldev.s3.amazonaws.com%2Fi%2Flui70mq4dppuztva6uyx.png)
Hello👋,
*My name is Alex and I'm maker of Devmates.co. 😊
We are resolving daily coding problems which asked by top tech companies together. We share our solutions, give some help if anyone stuck, support each other and just hangout together in the internet. 🍻☕️💬
I get this problem from our members or just searching them in the internet(leetcode forums, Glassdoor, teamblind, etc.). Sometimes this problem can be very easy, sometimes too 👷♂️hard, everything depends on skills but we are trying to resolve all of them and Have Fun. 🙌
Today I want to share problem which was asked by 📦 Amazon.
Problem:
Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.
Example:
Input:
1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0
Output: 4
Top comments (0)