Set Matrix Zeroes | O(1) Space Approach | Brute - Better - Optimal

Problem Link: bit.ly/3CukQke
Notes/C++/Java/Python codes: takeuforward.org/data-structu...
We have solved the problem, and we have gone from brute force and ended with the most optimal solution. Every approach's code has been written in the video itself. Also, we have covered the algorithm with intuition.
Full Course: bit.ly/tufA2ZYt
You can follow me across social media, all my handles are below:
Linkedin/Instagram/Telegram: linktr.ee/takeUforward
00:40: Problem statement
01:49: Brute-force solution
05:13: - Code
06:28: - Complexity
07:10: Better solution
12:16: - Code
13:49: - Complexity
14:17: Optimal solution
23:24: - Code
29:02: - Complexity

[@takeUforward]

Please watch our new video on the same topic: ua-cam.com/video/N0MgLvceX7M/v-deo.html

[@SujitKUmar-gy5xr]

bhaiya same hi to dono hai

[@saisree04]

Mind got blown away after listening to the optimal solution

[@ranjani7896]

😂😂

[@saisree04]

mind got blown away after listening to the optimal solution

[@takeUforward]

Let's march ahead, and create an unmatchable DSA course! ❤
Use the problem links in the description.

[@suyashpurwar631]

I was able to do the second approach by myself and I'm feeling really good about it!

[@RohanKumar-gy4gl]

HOLY S... bruh is an einstein for sure

[@adityamadhav1509]

its not a big deal though, but it really ensures that u r growing as a coder ,keep it up bruh.regarding second approach i though that instead of using two arrays row and column,we can just use one array of pair type where each element of the array is a pair whose first element is ,arked row and second elemen is marked column.

[@dpxy1599]

This optimal approach is confusing.

[@KaifKhan-sb2yr]

Watch again easy it is 😊

[@CodeBoost8375]

Understood! Very well 🔥🔥🔥. And half a hour to example every step from intuition ---> approach till code it shows how you work hard to provide such wonderful video's thanks a lot for this efforts brother.

[@vivekdalal1724]

this is the only study related playlist which im binging by choice and loving it

[@jatinsharma1595]

Understood. Happy that I came up with the better approach by myself, seriously blown away by the optimal approach. Thank you so much Striver

[@yugal8627]

OMG , I had watched many tutorials for this problem but never understood it clearly . Thankyou very much for your step-by-step detailed explanation , looking for more content from you in future🙂

[@Manishgupta200]

Really amazing Striver. In-place space optimisation method is really out of my imagination. you make everyting real in very much optimal way. Thankyou Striver for such an amazing tutorial ❤

[@josephwilliams9]

Code from older video is better.
Also I understood the intuition in this video's explanation by understanding it from older video.
A request - PLEASE DON'T DELETE OLDER VIDEOS EVER, THEY TOO ARE GEM ❤

[@kamalakannanng4206]

Can you please share the older video link ?

[@dxan]

Your teaching skills are very well and I must say they are on another level. Thank you so much for the content.

[@cinime]

Understood! Amazing explanation as always, thank you very much for your effort!!

[@devanshulpratapsingh5963]

So desperately trying this question for 2 days wasn’t able to optimise it, Now I can❤🔥

[@Atharva_kathiyawadi]

along with i really learn how to write clean code & improve readability !! thanks striver

[@krishsachdeva1105]

Bhaiya abhi shayad itne views nhi aarhe but rojj video daalte raho iss course ko complete karna and this will smash all education viewing records.
Salute++

[@hari7110]

super bro, i got 1st approach and was scratching my head to optimize it , watched last method twice now i understood🤩

[@yashwairagade3677]

U r a legend bro i am impressed by your problem solving skills

[@anushkachavan5065]

You are my motivation to solve the dsa problems every day. Thanks for providing these videos, it helps a lot🔥

[@hashcodez757]

great brother!!
just can't imagine the optimizations you made
hats off sirr!!

[@juliechoudhary9582]

Understood and it's Amazing How you teach.

[@jaydeepkarena]

Great explanation Raj. Thanks for creating this videos. Keep making videos like this. I have just started your SDE sheet for learning DSA

[@NikitaSingh-kz2ii]

watched the video thrice to finally get optimal approach to my head.
thankyou for the efforts🤗🤗🤗

[@sunnyvlogs__]

Literally Awesome Explanation , easiest way

[@surabsebait5409]

Understood, very clearly explained

[@mgnfy-view]

Beautiful explanation!

[@CodingEnv]

You are the soul and heart of DSA.

[@AjayKumar-sx6qo]

OMG !!! Awesome explanation.. Thanks Striver

[@NaveenKumar-xq6ce]

Your consistency is admirable @Striver

[@AyushSharma-ye1xz]

All videos are very helpful ❤️

[@tridibeshmisra9426]

Very good algorithm .... the optimal one is really good. Thanks a lot, sir!

[@jeetdesaimusic]

Crystal Clear Explanation!

[@krishanubiswas6869]

Thanks striver, ....however i would like to mention my code....when i solved the code by myself....i used a treemap to keep an account of the zeroes.....and then iterated through the map turning all the stored rows and columns to 0....however actually this approach came to my mind from your vertical order traversal of binary tree where you used almost the same data structure....and my solution was accepted (though the T.C was bad)....but still thanks for helping to build me my own approach....and the optimal solution was superb...

[@ankitasharma3930]

thank you so much for such a great effort.

[@hareshnayak7302]

Understood,Thank you striver for this amazing video.

[@prashantsharma7869]

best explaination ,just love it!!

[@prathameshhatkar1911]

Great optimisation 🔥

[@Akash-yr2if]

Gained some Brain Cells After doing the Optimized, Still getting in my head, Damn Solution 🤯🤯

[@AbhishekSingh-mh2fg]

Recently started learning DSA, i was able to come up with the same approach as 1st and 2nd, even though I couldn't complete it but I'm happy I came with some approaches.
Thanks for this great explanation.

[@subhambachar]

just blew my mind, The OP optimal approach 🤯🚀

[@luckydev9006]

Thank you for providing such good content

[@rajatrathore5455]

Understood , great explanation

[@RaviKumar-sn6tu]

watched your video ...then others video...then again your video ...then finally understood it😇😇

[@ankush8243]

Thank you so much🥰
Very much helpful !!

[@AdarshKeshari-wc2uz]

Understood after going through twice
❤❤
Best explanation

[@shivammotani]

IDK why I felt the older video was more good. Found that one to be better. Even optimal code for that one is easier to understand.

[@user-ik3qu5uy5e]

AMAZING SIR , UNDERSTOOD VERY WELL

[@myyoutubeisthis]

Thank you sir you're great.

[@rishabhkala2115]

thanks for this explanation
understood everything

[@sakthipriya8653]

Understood sir, very great explanation. I was very excited in the 7th minute itself. 🔥🔥🔥

[@SaifUddin-mq1gk]

7 7 7 7 7 7 !!!!

[@FooBar-lb5wf]

Amazing explanation, thank you! For the second pass through the array, I tried a slighly shorter approach which seems to work as well (tested on Leetcode). Process the elements bottom to top, right to left. This ensures that an element (i,j) is always updated before its row indicator (matrix[i][0]) and col indicator (col0 if j==0 else matrix[0][j]) are processed. We can then update them through single pair of loops over the array and we may not need special handling for matrix[0][0] and col0 elements.

[@karanveersinghdeora5085]

Understood very well

[@user-yw6zj3ir8p]

crystal clear approach

[@TheEleetcoder]

inspired by you and making videos like you!

[@shivamgurjar8979]

Such a great solution ✨

[@AnkitYadav-sk4nw]

Thank you Bhaiyaa!❤
❤

[@samuelfrank1369]

Understood. Thanks a lot

[@mashkoorahmad1885]

NEXT LEVEL man 😍😍🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥loved your videos

[@konankikeerthi]

Understood. Thank you bro

[@shloksuman8164]

Optimal approach was quite tedious to understand, however , I got it after writing down the code again myself

[@takeUforward]

Yes that is the reason I went slow and long, but writing it yourself helps to clear so many things.

[@nivetha6167]

You gave me hope when it comes to dsa... I'm too late being misled by other videos, but now after discovering your sde sheet, I have started to figure everything out in a planned manner... soooo... thank youuuuuuuuuuuu!!!!

[@bully9858]

u are literally me

[@nivetha6167]

@@bully9858 all the best with your coding Journey :⁠-⁠)

[@GOJOANDSUKUNAFAN]

​@@bully9858bro is actually him🗣️ 🔥🔥

[@pallavi22222]

Superb Explaination

[@chethanprabhu4475]

I had not understood when I watched it 2-3 days back. Looks like I had watched a video which was recorded 2 years back lol. But this new video is crisp clear

[@takeUforward]

Yes re-rrecorded, the previous videos were for people who already knew dsa

[@vivekpatial5614]

​@@takeUforward Your teaching skills are on another level :)

[@ddevarapaga5134]

wow mindblown amazing understood bro

[@tamilmukbang3789]

understood thank you so much bro

[@NitinKumar-wm2dg]

Understood bhaiya, thank you

[@abdulrehmaan153]

You just added one more #fan in your infinte length array ❤

[@RahulYadav-jk7um]

Was able to come up with better solution but did little mistake in the implementation , happy to see that I am now able to come with logical approach to solve problems
All thanks to striver bhaiya! ❤

[@parthtiwari8152]

Loved ❤ ...
Understood

[@shivamsingh7817]

Thank you so much bhaiya ❤️❤️❤️❤️

[@user-cz4lk8qi2q]

Amazing Bhaiya !

[@priyotoshsahaThePowerOf23]

First code in spreadsheet and got some feel🥵😱❣❣

[@user-ui6op1zc2q]

just awesome ♥

[@prasoonmishra995]

Awesome 👍

[@user-ui9fw7qj5n]

understood striver
Thanks

[@itsabhinav04]

Understood, thanks :)

[@suyashshinde2971]

SDE Sheet: Day 1 Problem 1 Done!

[@myyoutubeisthis]

Thank you very very very very much sir

[@poojithkumar2283]

good approach👏👏👏

[@YourCodeVerse]

Understood✅🔥🔥

[@rohitraj5832]

for optimal approach, while filling the matix, instead we can directly traverse the matrix In reverse order so that matrix[0][0] will be affected at last. i mean run loop for(row=m-1 to 0) { for(col=n-1 to 0)}. it worked 😀😀
//fill the matrix
for(int i=m-1;i>=0;i--){
for(int j=n-1;j>=0;j--){
if(j==0){
if(col0==0)matrix[i][j]=0;
}
else{
if(matrix[i][0] == 0 || matrix[0][j] == 0)
matrix[i][j]=0;
}
}
}

[@sukritinarang5016]

The brute force solution that set values to -1 instead of 0 will not work in some test cases as constraints are mentioned as -2^31

[@SunnyYadav-zv7hp]

Love you so much bro

[@yuvrajpatil925]

Thanks 🙏

[@Se7ven_Plays]

Thankyou. Bhai for videos 😶

[@kushagramishra5638]

Understood !

[@GhostVaibhav]

Understood🔥

[@AbhishekKumar-cv1dh]

Understood!!! 🔥🐢

[@creativeprojects217]

thank you sir❣

[@GauravJain-zo8gt]

jai jinendra sir understood

[@shikhajoshi8961]

Understood Sir💗🙏

[@prathiswarangr7879]

Understood ❤

[@heyOrca2711]

Understood Sir!

[@HARSHA_27]

Understood!!🙇‍♂

[@vardhamanbhandari5644]

Understood🙌🙌🙌🙌

[@rajalakshmis7308]

Understood👍🏻

[@KartikeyTT]

tysm sir

[@nagame859]

Understood sir🤩

[@shaiksoofi3741]

Thank you