Maximum size square sub-matrix with all 1s

[@tempregex8520]

i wasn't able to wrap my head around why we need to take the min, but glad you explained it! Thank you

[@IDeserve]

😊

[@piyush12121]

Great solution. One of my friends got same question in his Microsoft Interview. He solved it by brute force though and got selected as well.

[@IDeserve]

+Piyush Chaudhary That was quick! We had uploaded the video just few minutes back :) Please convey congratulations from IDeserve Team to your friend for being selected in Microsoft :) And thanks for your words! We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Thanks, -Team IDeserve.

[@ChandraShekhar-by3cd]

Best Explanation Ever on this. Thanks a lot for making such a crystal clear explanation.

[@IDeserve]

Thanks Chandra!

[@naveenmarikar4829]

You explained it in a way that anyone can understand. Really hats off guys . Great job. Please keep it coming.

[@RajatSharmatonystark]

Very nice and concise solutions to all Dynamic programming problems.Thank you sir.

[@IDeserve]

+Rajat Sharma Thanks a lot for your words! We are striving hard to make understanding algorithms easier. We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like algorithm visualizations, learn together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@Saravanakumar-rn8fw]

solution is narrated in so simple and clear way.. Thanks for the video..!

[@IDeserve]

+Saravana Kumar B Thanks a lot for your words! We are striving hard to make understanding algorithms easier. We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. We hope you have already checked out our website: www.ideserve.co.in :) Thanks, -Team IDeserve.

[@robertsedgewick1266]

Great explanation. Other channels also tried to cover the same approach, but your explanation and delivery w the apt use of visual illustration made it much easier to understand.

[@IDeserve]

Thanks Robert!

[@aayushit1513]

Thank you so much! Your videos really help as they not only give the solution but also explain the intuition behind it!

[@IDeserve]

Thanks Aayushi!

[@vishalpolley3508]

3:00 The algorithm step 2. c). should be table[i][j] = min (table[i-1][j], table[i-1][j-1], table[i][j-1]) + 1

[@ShivamSingh-me1nb]

Excellent explanation of this problem

[@IDeserve]

Thanks Shivam!

[@IDeserve]

Dear Friends, If you like our content and would like us to continue making great content for you, please spread the word about IDeserve. A share/appreciation from you on social network would mean the world to us! Also, do like our Facebook page: facebook.com/IDeserve.co.in :) Thanks, -Team IDeserve.

[@abhishekjaiswal6492]

great explanation bhaiya, clear crystal explanation

[@IDeserve]

Thanks Abhishek!

[@Andrea-rq8yo]

Really nice explaination!

[@IDeserve]

Thanks Jun!

[@saivasanth8819]

Best explaination, great work , thanks a ton :)

[@IDeserve]

Thanks Sai!

[@agniswarbakshi5765]

Wonderful explanation with examples ! :) Would really appreciate if some software design questions are also discussed which are often asked in interviews !

[@IDeserve]

Thanks a lot for your words Agniswar :) We are striving hard to make understanding algorithms easier. We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@kingshukjana4718]

Videos are too good.. I dont find any other website having such great videos..

[@IDeserve]

Thanks Kingshuk for your kind words :) If you would like to request a new video, here is the process: kzbin.info/www/bejne/aZe0fYKcqrKZopI We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Thanks, -Team IDeserve.

[@prathyusharaman8392]

Tq sir you explained neatly....

[@IDeserve]

Thanks Prathyusha!

[@Aryan-wv6qe]

Your explanations are really helpful for us. Please upload the videos of left problems which are there on your website.

[@IDeserve]

Thanks Raj for your kind words :) Here is the process for requesting new videos: kzbin.info/www/bejne/aZe0fYKcqrKZopI We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Thanks, -Team IDeserve.

[@surathsrivastva6727]

Keep on making new videos regularly .

[@IDeserve]

+Naveen Marikar Thanks you so much for your kind words! We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. We hope you have already checked out our website: www.ideserve.co.in :) Thanks, -Team IDeserve.

[@MrRastoginitin01]

very nice video...concept clearly explained...can we have more tutorials on Order Statistics?

[@IDeserve]

+Nitin Rastogi Thanks a lot for your words! We are striving hard to make understanding algorithms easier. We will soon come up with tutorials on the requested topic and will intimate you. We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like algorithm visualizations, learn together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@thatoneguy908]

at 3:06 it should be --> c: else table[i][j] = min(table[i - 1][j - 1], table[i - 1][j], table[i][j - 1]) + 1;, i got confused for much time!

[@pranithakandimalla6359]

Thanks a lot!!!

[@reassume4826]

Thank You.

[@saicharan8675]

Dude thank you

[@IDeserve]

Thanks Charan!

[@11m0]

How did you know to take the min between all 3 numbers. What clued you into taking the minimum between all 3 and adding 1?

[@PoonamYadav-dh6qz]

nice video, can you provide the solution for Maximum size rectangle matrix with all 1s as well?

[@IDeserve]

+Poonam Yadav Thanks a lot for your words! As per your request, we will soon come up with an article on the requested problem. We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like algorithm visualizations, learn together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@kamalsmusic]

How are we supposed to come up with this in a interview? It seems hard especially during a phone interview :(

[@BullsEye2.0]

It really helped.... excellent work... keep it up :)

[@IDeserve]

Hello Father :D Thanks for your kind words :) We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Thanks, -Team IDeserve.

[@shubhammishra3012]

In else condition you have to do table[i][j]=min(table[i-1][j],table[i-1][j-1],table[i][j-1])+1

[@JigarShah2811]

Great video!

[@IDeserve]

Thanks Jigar for your kind words :) We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@shubhamvardaan3576]

Simply awesome .:):):):)

[@IDeserve]

Thanks Shubham for your kind words :) We are striving hard to make understanding algorithms easier. We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@vijaysahani1515]

how to solve this problem with at most 1s ????

[@tushargoel5522]

solution is fine but how do u approach this solution? I think that's more imp than the solution itself.

[@cbest3678]

@Tushar Goel..I agree .. many people just put video content based on someones solution either in book or leetcode. .. they make video out of it.. without telling how the thought process started. Because thought process matters in interview and also help your brain develop in that direction....since today we know the solution for this problem if some other problem comes ... we will get hard time to come up with optimal solution.

[@soumavanag5025]

Too good!! :)

[@IDeserve]

Thanks Soumava for your kind words :) If you would like to request a new video, here is the process: kzbin.info/www/bejne/aZe0fYKcqrKZopI We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@shibajipaul]

at 2:52, the logic in 2, in the else part is wrong, it should not be table[i][j] = min(matrix[i-1][j], matrix[i-1][j-1], matrix[i][j-1]) + 1, but should be: table[i][j] = min(table[i-1][j], table[i-1][j-1], table[i][j-1]) + 1.

[@JimitRupani]

how value in the second matrix at (3,2) = 0 as you can apply min(three values)1 = value(3,2). when all those value are 0,0,1 so it should be 1.

[@IDeserve]

+Jimit Rupani Could you please point out the exact time-stamp in the video where you have doubt?

[@Wumbolo]

those values are not 0,0,1. the values are of DP not matrix

[@chandan9990]

wrong statement at 2:56 else table[i][j]=min(matrix[i - 1][j - 1], matrix[i - 1][j], matrix[i][j - 1]) + 1; correct one = else table[i][j] = min(table[i - 1][j - 1], table[i - 1][j], table[i][j - 1]) + 1;