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 like this solution but is this considered Binary Search? I feel like we really aren't making big initial cuts, but in theory this does have a similar but less steep curve structure as a binary search .
u can also do double binary search to get result, first do it to find what row the ans would lie in and then find for answer in that row and that would boil down the time complexity to logn + logm
Hi brother, I know the basic coding .I want to learn the DSA From scratch so where u have to watch the videos of one by one .please help me out.... Thanks
sir i was following your dp series and i just saw this video randomly and found that u look a bit tired and low energy in this video as compared to dp series videos
Please watch our new video on the same topic:ruclips.net/video/JXU4Akft7yk/видео.html
Thanks for the awesome content ! Very crisp and systematic explainations :)
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.
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?
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.
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 😂??
😈
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!
UNDERSTOOD...........Thank You So Much for this wonderful video...........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
The idea was worth it .
Please continue the series............
Happy Teachers Day Sir/Bhaiya! Thanks for making our lives better and happier :)
One full video on bit manipulation tricks and techniques please☝️
Striver! What's next after this amazing BS Playlist?
Bhaiya which topic will come next ?.....what are upcoming plans 🤔🤔🤔🤔
After a long time 🥵
you are an absolute genius man!
After a long wait .please striver consistently video upload kijiye please
bhaiya pls string aur linked list ke videos daal do
Hello Sir, Your teaching is awesome even a 10th class student can understand your videos completely
Bhaiya , your lectures are amazing , please increase the frequency of the lectures
Sir,
Please continue your solution videos for A-Z DSA course.
Understood! Such a great explanation as always, thank you very much for your effort!!
Thank You Mr. Legend
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...
Super awesome solution...!
Waiting for the videos pls complete the course ❤
Thank you sir for your intense effort in making such great videos
very well explained sir!
Understood,Thanks Striver for this amazing video.
bhaiya aise hi aur topics ki bhi videos jaldi se please laate rho
i had done this before..so this approach i knew....coded it by myself....thanks bhai
that is the best leetcode solution video I have seen :)
Mindblown!!!
very crisp,very nice explanation
This was so much fun!
man this is so brilliant!!!
Understood! Super awesome explanation as always, thank you very very much for your effort!!
Nice trick + explanation + approach
Understood Sir, very well explanation Sir, Thanks a lot for the video.😃
Understood
sir make videos on bit manipulation
Hey @takeUforward, I think the TC is O(m+n-2). please correct me if I am wrong.
Great video
Understood! You are just awesome bhaiya ❣
Best explanations ever
I am not able to login into my take u forward account using my mail id, all my progress is lost, is there a problem in website? please resolve!!
can you please upload egg dropping problem
Understood ❤❤❤❤❤
understood
understood amazing it was just wonderful lectures
Superb explanation
Understood, thank you.
thank you so much bhaiya
Understood🙂
Bhaiya can you make next playlist on greedy algorithms
UNDERSTOOD! EXPLANATION TOOO GOOD😀❤
understood !! very nice video.
Great explanation
Plz upload a2z videos fast
UNDERSTOOD;
Thank you Bhaiya
is there any practical application of this algorithm ?
Bhai, don't you create string and recursion playlist???
What device are you using to write your notes on please answer, need a note taker for college this semester
Thansks a lot Bhaiya
Amazing video. Could you tell which tool you are using in this video.
the better soln had o(n) + logm yeah, isnt it better than o(n+m)?
Understood✅🔥🔥
Thanks
Happy Teachers's Day Sir
striver sheets are not working so sad bro
thanks bhai!
15:09 understood
tysm sir
u are amazing thop striver bhaiya
Cant we solve this in O(logn*logm) which is less than O(n+m)
Loved it❤
Solved myself❤
hats off to you 😇😇
understood!!
Wow!
if(mat[row][col] < target) // example - mat[3][1] = 13; for this then it will go to next row and it will fail?
{
row++
}
I like this solution but is this considered Binary Search? I feel like we really aren't making big initial cuts, but in theory this does have a similar but less steep curve structure as a binary search .
u can also do double binary search to get result, first do it to find what row the ans would lie in and then find for answer in that row and that would boil down the time complexity to logn + logm
Understood ❤
God bless you bro
Amazinggggggggggggggggggggggg
Hi brother,
I know the basic coding .I want to learn the DSA From scratch so where u have to watch the videos of one by one .please help me out....
Thanks
Understood👌
Which platform can I study low level design can u suggest me something
happy new year ❤
Understood;
very nyc
thank you sir
nice
sir i was following your dp series and i just saw this video randomly and found that u look a bit tired and low energy in this video as compared to dp series videos
He has a full time job as well. It's not easy to manage.
Got it sir
understood!
Understood
Cover Fenwick tree bro!
understood