-
-
Notifications
You must be signed in to change notification settings - Fork 155
Maximal Square Solution (Leetcode) Added problem number 221 #878
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
Here's the code health analysis summary for commits Analysis Summary
|
Hi @ajay-dhangar , i have added solution you can review it. And tell me the suggestions. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
update code based on suggestions
@@ -0,0 +1,130 @@ | |||
--- | |||
id: Maximal Square |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
replace id: Maximal Square
to id: maximal-square
|
||
## Problem | ||
|
||
You are given an m x n binary $matrix$ filled with $0's$ and $1's$, find the largest square containing only $1's$ and return its area. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
replace $0's$
to 0's
and $1's$
to 1's
- $m == matrix.length$ | ||
- $n == matrix[i].length$ | ||
- $1 <= m, n <= 300$ | ||
- $matrix[i][j]$ $is$ $'0'$ $or$ $'1'$ |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
replace $is$
to is
|
Hi, @ajay-dhangar resolved, can you check it and give suggestions |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Done
Related Issue
Fixed : #843
Description
I had Added the Solution of problem "Minimum Cost to Connect Two Groups of Points" under Leetcode Solution > 0200 - 0299> 221
Type of PR
Screenshots / Videos (if applicable)
[Attach any relevant screenshots or videos demonstrating the changes]
Checklist
Additional Context
[Include any additional information or context that might be helpful for reviewers.]
Resources for Guidance
Here are some resources that may be helpful as you contribute to CodeHarborHub:
Resources for DSA Features on Our Site: