The amazing thing is I have solved this question before in the best TC in my interview and still learnt something new today. Thats why I never skip any video.
I already knew the both the solution but watched for my satisfaction and i learnt the reason behind choosing top rightmost element for starting of matrix in second solution. So, no matter you already know or not. Just watch videos. Who knows you will find something new!
Maybe its just me (most likely not) but the quality of videos is so great that I like them first and then watch them. I know the explanation would be great.
Happy Teachers Day striver... You are the best teacher Today my life is changed and i am holding my dream company offer because of your videos, am always grateful to you. your teaching style is awesome.
i did from another two ways both of my two ways are same but just a little tweak one gives TC of O(m+n) and another gives TC of O(logmxlogn) -- this is better TC incase input is long
cant we do binary search to find floor of the given number and directly jump to there instead of moving one by one step, like for every iteration we willdo binary search on row and update col variable and then do binary on that column and update row variable?... as this also moves in the same path but faster right? am i crct?
stand on top-right if left and below both smaller than target, move to below if left and below both bigger than target, move to left if left smaller and below bigger than target, move to left-below diagonally if left bigger and below smaller than target, not possible
Please watch our new video on the same topic:th-cam.com/video/JXU4Akft7yk/w-d-xo.html
Thanks for the awesome content ! Very crisp and systematic explainations :)
UNDERSTOOD...........Thank You So Much for this wonderful video...........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
The amazing thing is I have solved this question before in the best TC in my interview and still learnt something new today. Thats why I never skip any video.
what was your approach back then
Really want to know how you solved it then
I already knew the both the solution but watched for my satisfaction and i learnt the reason behind choosing top rightmost element for starting of matrix in second solution.
So, no matter you already know or not. Just watch videos. Who knows you will find something new!
Want to thank you sir ❤️, your sde sheet and videos helped to grab an intern at Atlassian. Couldn’t be more thankful !!
Hey bro are you in which semester?
@@harshilpatel3205 6th Sem
@@harshilpatel3205 6th semester
Can you guide me pls
stipend? college?
Maybe its just me (most likely not) but the quality of videos is so great that I like them first and then watch them. I know the explanation would be great.
Striver will be remembered as a legend for the Indian IT community.. He is amazing teacher and humble gay.
Gay?🤔
@@NikkiWarrior-u3t😂😂 typo hoga mp
Gay 😂??
😈
The idea was worth it .
Please continue the series............
very crisp,very nice explanation
Happy Teachers Day striver... You are the best teacher Today my life is changed and i am holding my dream company offer because of your videos, am always grateful to you. your teaching style is awesome.
could i get a refferal for internship by chance? ive followed the playlist from the beginning till here and will continue to complete it!
@@randomtsareenalover9014 did you finish it?
After a long wait .please striver consistently video upload kijiye please
Hello Sir, Your teaching is awesome even a 10th class student can understand your videos completely
Happy Teachers Day Sir/Bhaiya! Thanks for making our lives better and happier :)
Understood! Such a great explanation as always, thank you very much for your effort!!
i had done this before..so this approach i knew....coded it by myself....thanks bhai
After a long time 🥵
Understood,Thanks Striver for this amazing video.
One full video on bit manipulation tricks and techniques please☝️
that is the best leetcode solution video I have seen :)
you are an absolute genius man!
Thank you sir for your intense effort in making such great videos
Bhaiya , your lectures are amazing , please increase the frequency of the lectures
bhaiya aise hi aur topics ki bhi videos jaldi se please laate rho
Thank You Mr. Legend
Waiting for the videos pls complete the course ❤
Understood Sir, very well explanation Sir, Thanks a lot for the video.😃
Understood! Super awesome explanation as always, thank you very very much for your effort!!
Striver! What's next after this amazing BS Playlist?
Great Explanation!! Thanks!!
Nice trick + explanation + approach
Understood! You are just awesome bhaiya ❣
Sir,
Please continue your solution videos for A-Z DSA course.
Thank you so much sir for such a clear explanation
This was so much fun!
very well explained sir!
man this is so brilliant!!!
basically if target>[i][j] eliminate row else if t
UNDERSTOOD! EXPLANATION TOOO GOOD😀❤
Best explanations ever
bhaiya pls string aur linked list ke videos daal do
Super awesome solution...!
Great explanation
Superb explanation
Understood, thank you.
thank you sir ji....
understood amazing it was just wonderful lectures
understood !! very nice video.
Understood✅🔥🔥
Great video
hats off to you 😇😇
Mindblown!!!
Understood ❤❤❤❤❤
u are amazing thop striver bhaiya
Loved it❤
God bless you bro
Understood ❤
Bhaiya which topic will come next ?.....what are upcoming plans 🤔🤔🤔🤔
sir make videos on bit manipulation
Understood🙂
Understood 😀
thank you so much bhaiya
Happy Teachers's Day Sir
Solved myself❤
15:09 understood
Understood👌
happy new year ❤
Understood!
Bhaiya can you make next playlist on greedy algorithms
thanks bhai!
Thank you Bhaiya
i did from another two ways both of my two ways are same but just a little tweak one gives TC of O(m+n) and another gives TC of O(logmxlogn) -- this is better TC incase input is long
Thansks a lot Bhaiya
UNDERSTOOD;
understood!!
Amazing video. Could you tell which tool you are using in this video.
Got it sir
thank you sir
Thanks
tysm sir
cant we do binary search to find floor of the given number and directly jump to there instead of moving one by one step, like for every iteration we willdo binary search on row and update col variable and then do binary on that column and update row variable?... as this also moves in the same path but faster right?
am i crct?
can you please upload egg dropping problem
Cover Fenwick tree bro!
Why I can't see Steps 1 to 18 on A2Z DSA Course sheet on website? @Striver Please look into it, can only see step 19...
understood!
Understood
very nyc
Plz upload a2z videos fast
Hey @takeUforward, I think the TC is O(m+n-2). please correct me if I am wrong.
Amazinggggggggggggggggggggggg
understood.
nice
Wow!
Superp explanation 🤍🔥
stand on top-right
if left and below both smaller than target, move to below
if left and below both bigger than target, move to left
if left smaller and below bigger than target, move to left-below diagonally
if left bigger and below smaller than target, not possible
i love you brother
Understood
O(m+n) vs nLog(m) or mLog(n) .
is there any practical application of this algorithm ?
the better soln had o(n) + logm yeah, isnt it better than o(n+m)?
better soln had O(n) x log m not "+" that's why it's not optimal approach