Maximal square | Dynamic programming | Leetcode

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.
Example 1:
Input: matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]
Output: 4
Example 2:
Input: matrix = [["0","1"],["1","0"]]
Output: 1
Example 3:
Input: matrix = [["0"]]
Output: 0
Constraints:
m == matrix.length
n == matrix[i].length
matrix[i][j] is '0' or '1'.

[@thellaidhinesh8929]

i thought this was very complexed problem. after watching this video, i got the confidence to solve this problem. Thanks alisha!

[@amanchaudhary8817]

excellent explanation mam.

[@ankk98]

The intuition behind this algo is that we are checking for all possible squares ending at the given index.
So, we are using the results of maximum sized squares ending at 3 adjacent indexes and using that information to find out the max possible solution at current index.

[@manojtate9604]

Great clarification! 😃

[@user-gf1dp1zw8v]

I have a dought, you are returning the max area by 3* 3 but the right area is 2*3 right???

[@pabitrakb5291]

Nice explanation 😊

[@Shivam-wl7fg]

Nice Explanation 😃

[@shivanshpareek7278]

please add the link as well and ur playlists are best way to revise and the way you explain gives me confidence to speak in interviews ..
Thanks a lot for amazing content

[@probabilitycodingisfunis1]

Thank you Shivansh, will add links to questions from now on :)

[@govinth2462]

I mam I want talk with your about my features opportunity where can connect with you

[@prasannaprabhakar1323]

The way you are conveying the intuition part of the solution creates the difference.
Nice choice of questions btw.

[@shivanshyadu4830]

Ufff didi one of the best place and you just explained the code in really easy way, I saw everyone's video but they just copy pasting the solution ❤❤😊

[@probabilitycodingisfunis1]

Thanks a lot 😊

[@Corona0715]

Are you sure czcams.com/video/RElcqtFYTm0/video.html

[@BereniceVirginis]

Space Complexity: O(1)
int maxSquare(int n, int m, vector mat){
// code here
int ans=0;
for(int i=0;i

[@Coding_Destini]

Thank you so much for this approach ... this is really easy

[@kpjVideo]

Great explanation! This helped a bunch!

[@willingtushar]

Nice explanation Indeed!

[@probabilitycodingisfunis1]

Glad you found it helpful!

[@user-bb8os4rw5i]

thankyou so much worth watching!!!!

[@duck3072]

Can we solve problems by filling dp from last cell to first

[@shanidandanayak3806]

Arigatho

[@vikashdhania2970]

thanks mam

[@probabilitycodingisfunis1]

Most welcome 😊

[@raj_kundalia]

thank you!

[@anshulbhati5752]

greatt explanation!

[@shouryagupta8763]

thanks a lot didi!

[@anupamojha3836]

very nice explaination

[@rudrakshsharma4601]

nice work alisha

[@tiger7858]

inside if( i = = 0 || j = = 0) you are doing unnecessary work you can leave it as it is , nice explanation overall 🙏thank you