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
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
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
Public class solution { static boolean Search matrix (Array list mat,int target){ int m=mat.size (), n=mat.get (0).size (); int row =0, col=n-1; while (row=0){ if(mat.get[row][col]==target) return true; else if(mat .get[row][col]
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
![I.N "HALLUCINATION" | [Stray Kids : SKZ-PLAYER]](http://i.ytimg.com/vi/n5B5q1Hwt_U/mqdefault.jpg)
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.
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!
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.
UNDERSTOOD...........Thank You So Much for this wonderful 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?
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!
The idea was worth it .
Please continue the series............
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 :)
After a long wait .please striver consistently video upload kijiye please
i had done this before..so this approach i knew....coded it by myself....thanks bhai
very crisp,very nice explanation
Bhaiya , your lectures are amazing , please increase the frequency of the lectures
Thank you sir for your intense effort in making such great videos
Understood! Such a great explanation as always, thank you very much for your effort!!
that is the best leetcode solution video I have seen :)
Understood,Thanks Striver for this amazing video.
you are an absolute genius man!
One full video on bit manipulation tricks and techniques please☝️
Understood! Super awesome explanation as always, thank you very very much for your effort!!
After a long time 🥵
bhaiya aise hi aur topics ki bhi videos jaldi se please laate rho
Understood! You are just awesome bhaiya ❣
Understood Sir, very well explanation Sir, Thanks a lot for the video.😃
Nice trick + explanation + approach
Striver! What's next after this amazing BS Playlist?
Thank You Mr. Legend
Thank you so much sir for such a clear explanation
Waiting for the videos pls complete the course ❤
very well explained sir!
Best explanations ever
Sir,
Please continue your solution videos for A-Z DSA course.
Great Explanation!! Thanks!!
understood amazing it was just wonderful lectures
Happy Teachers's Day Sir
UNDERSTOOD! EXPLANATION TOOO GOOD😀❤
Superb explanation
Super awesome solution...!
man this is so brilliant!!!
bhaiya pls string aur linked list ke videos daal do
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...
Bhaiya which topic will come next ?.....what are upcoming plans 🤔🤔🤔🤔
This was so much fun!
Great explanation
understood !! very nice video.
u are amazing thop striver bhaiya
15:09 understood
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
Understood✅🔥🔥
sir make videos on bit manipulation
hats off to you 😇😇
Loved it❤
Solved myself❤
happy new year ❤
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!!
Great video
Bhaiya can you make next playlist on greedy algorithms
Understood, thank you.
God bless you bro
Hey @takeUforward, I think the TC is O(m+n-2). please correct me if I am wrong.
can you please upload egg dropping problem
striver sheets are not working so sad bro
Understood ❤❤❤❤❤
Understood👌
Understood ❤
Amazing video. Could you tell which tool you are using in this video.
Understood 😀
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
Mindblown!!!
Understood🙂
thank you so much bhaiya
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
is there any practical application of this algorithm ?
Thank you Bhaiya
Which platform can I study low level design can u suggest me something
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
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
Cover Fenwick tree bro!
if(mat[row][col] < target) // example - mat[3][1] = 13; for this then it will go to next row and it will fail?
{
row++
}
thanks bhai!
Thansks a lot Bhaiya
Understood!
Can someone please explain me the while loop condition 🙇
Cant we solve this in O(logn*logm) which is less than O(n+m)
yes we can do that
Public class solution {
static boolean Search matrix (Array list mat,int target){
int m=mat.size (), n=mat.get (0).size ();
int row =0, col=n-1;
while (row=0){
if(mat.get[row][col]==target) return true;
else if(mat .get[row][col]
Plz upload a2z videos fast
UNDERSTOOD;
thank you sir
Got it sir
tysm sir
understood!!
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.
Amazinggggggggggggggggggggggg
i love you brother
very nyc
understood!