Give this man a medal. In 23 minutes, he covered all 3 ways and DP with 2 examples. Just couple of suggestions to win much more subscribers 1) For your videos at least allow auto-translate 2) Instead of directly pasting the code, you can do think-out loud and tell us how you arrived at that code. Man, you deserve a round of applause.
Soumilya De Memoization ( not memorisation). It means store the result in data structure of ur choice and read from it in next call instead of recalculating again & again. Thus it become faster. If u r not clear let me know.
This is the 60th video I am watching from this playlist, and literally have not come across a single negative/criticising/jealous comment!! Such is the aura of an amazing professor!! Thank you Sir!
I'm not afraid to say that this man single-handedly got me through algorithms. Thanks for being my and the world's algorithm teacher. You are certainly up to the task!
I didn't understand anything in my class when my teacher was teaching this topic and I did not even try to understand because I knew that It will be clear only by Abdul sir's videos. You are Great man
Hello Abdul, how are you? I'm writing this comment just to say that I loved you video and I'm very grateful that there're people like you ready to share knowledge for free that's gold!!!! Thank you very much!
Watched all your UA-cam videos from scratch. Teaching in that way, which is simple to understand and will also be quickly absorbed by the students is an ART. You have got this brilliant ART sir. I have grasped all these concepts before college via your videos. Thanks a lot for providing knowledge for free. You are a real teacher and i hope that you will continue teaching us more through your videos.
I develop, design and lead efforts for various initiatives at Oracle. Even with 13+ years of experience I come back to this amazing man to appreciate his simplicity. Dear Sir, Your simplicity in explanation is infectious. It motivates me to go back to college one more time and appreciate how amazing it is to learn from a teacher like you. God bless you. :) :)
You are my role model in explaining concepts Teacher Abdul. Interesting, clear, and well-paced. I can't thank you enough for sharing this for free. I appreciate you and hope one day I can contribute to maintaining your courses.
Hi Professor Bari--THANK YOU SO MUCH for the videos!!! I'm currently a cs undergrad student taking basic algorithm, and I'm very confused by what I'm learning from school. But I'm so glad I found your videos because you made every algorithm SO CLEAR to me!!! I'm cramping for my midterm this coming Tuesday and having a meltdown because I'm so confused about the algos and your videos saved me. THANK YOU for all your great work!!!
Amazing! How come I have never thought of this solution! So trivial it seems but only when presented to you by such a master! Days, no Weeks of confusing and trying it on my own and now I see clarity! Amazing presentation!
Best algorithm teacher ever! Gotta love the dramatic way you turn to the camera at the end of your videos, when you know everything is explained and all the viewers understood!
No, few dislikes are because he just shows how algorithm works. Instead of showing how one can approach the solution without knowing solution already. Because approaching the solution is more important than mugging up solution. For example, he just showed the code for recursion without explaining one can think of writing that code without knowing the solution already.
@@kapilgupta8543 I think that cannot be taught. You just make tables with examples, fill them manually and try to see a pattern. That is my guess but I am not an expert!
My madam explained it in more detail like him as well but I am going to these for revision. So, not every teacher is like u all thought if u listen to them carefully they will also cover all these topics
The way he teaches is amazing. I failed to understand this topic in my college but you are the man who helped me understanding this topic I m first semester student of BVoc(software development and E governance) Thanks sir 🙏🏻❤️
Great to see you here Sir, I have attended your classes in ACE for DBMS and CN in 2011 and let me tell you I still hold the notes from your classes and are very very helpful for any interview prep. Thanks a ton (bow)..!!! One suggestion I would like to give for this video is in case of DP solution if you could have explained how the code is derived that would have been more understandable.
I really appreciate your way of teaching. Not even for a moment, you made me feel like this is a very complex topic. I have seen very few teachers teach this way. This makes me think how to communicate better with my colleagues. I think the opposite person should not feel like it is a complex issue.
After a horrible horrible lesson about this topic and leave with confusion, I am watching this video and finally understand the topic. Thank you so much ❤️
OMGSH, YOU MAKE IT SO CLEAR. Thank you so much for all your hard work with finding the correct examples and making this video so neat and short, but complete. Thank you soo much!
This guy is single-handedly giving us all our CS degrees despite the terrible profs some of us have in our algo uni courses! Props to this guy, liked and subbed 👌
Thank you mr.Bari. Last time I had watched your video , I picked up a very little. Now I could understand thoroughly because I had worked out this problem and it cleared my all doubts and I can apply it some other problems . Moral of the story is work out more problems and come to a such an intelligent teacher .
Sir, I saw this video after watching multiple dp youtube video but somewhere there was gap. But you're amazing, from today any topic first I will search in your channel.. You're too good if there is a match add 1 taking value from previous diagonal else max of previous row/colum.. Superb too good.. Bottom up, top down too good. I wish I watch this video before my amazon interview
Sir you are God Gifted. By only listening to your videos before exam brings back the confidence. Not everyone can teach as calmly and confidently like you! Thanks a ton for being saviour of so many students.
Never understood the diff between memoization and tabulation,thought they were both dp approach.I've just learnt it right now!Best explanation I've found on the internet till now!
Pay attention to how he uses plain recursion first, then memoization reduces number of calls(2^n --> m.n), and then he uses dynamic programming which is still O(m.n) but it outperforms recusrsions because recursive functions take a lot os space on the call stack and are generally slower tha for loops, every new way of solving the same problem adds to the performance, i used to jump directly to dynamic programming without understanding the problem it solves you can only truly understand(and appreciate) dynamic programming if you're coming from recursion
can you see my mistake ,i am geeting wrong answer #include using namespace std; #define ll long long // string dp[4001][4001]; vectordp(4001,vector(4001,""));
Sir, you are God. The way you explained the problem moving from Recursion to DP, explaining at each step the ways in which we can better the current solution, helped me understand this question which used to give me nightmares. Thanks a lot !
Thanks sir, your explanation is awesome. I love how you explain every single step using hand writing. Clear concept, this is all I need, the rest is just need to convert it to any programming language. I hope you are always healthy there
Thanks very much. That was crystal clear. I have a remark though : as far as I know, ameliorating recursion with memoization is still considered DP in the literature.
Awesome explanations. It would be better if you can explain why the addition is made to the diagonal element when a match is found and why the max of the other two is taken else. That helps in understanding the problem and solution deeper.
Simply superb. I felt like your lectures were similar to ravindra babu sir's lectures.Both of them lectures are very useful to understand the concepts very clearly. Hands off
Give this man a medal. In 23 minutes, he covered all 3 ways and DP with 2 examples.
Just couple of suggestions to win much more subscribers
1) For your videos at least allow auto-translate
2) Instead of directly pasting the code, you can do think-out loud and tell us how you arrived at that code.
Man, you deserve a round of applause.
many thanks from MONTREAL xxx
True!
and also, how to code for memorization. One such example would clarify the concept even better.
true bro! Hatsoff to this Man!
Soumilya De Memoization ( not memorisation). It means store the result in data structure of ur choice and read from it in next call instead of recalculating again & again. Thus it become faster. If u r not clear let me know.
This is the 60th video I am watching from this playlist, and literally have not come across a single negative/criticising/jealous comment!! Such is the aura of an amazing professor!!
Thank you Sir!
Attended zero lectures but understood everything from you. I'm a fifth sem student and.....god bless you sir 🤟🤟🤟🤟.
bhai lecture bhi par lena
@@harshjoshi6257 8th sem mai aa gaya bro clg khatam hone ko aayi hai.
😂
😂
@@harshjoshi6257 Aye tu jaa re! Yaha bhi aa gaya
I'm not afraid to say that this man single-handedly got me through algorithms. Thanks for being my and the world's algorithm teacher. You are certainly up to the task!
I didn't understand anything in my class when my teacher was teaching this topic and I did not even try to understand because I knew that It will be clear only by Abdul sir's videos.
You are Great man
so now tell me what didi you understand
@@techinframes longest common subsequence, duh
Hello Abdul, how are you?
I'm writing this comment just to say that I loved you video and I'm very grateful that there're people like you ready to share knowledge for free that's gold!!!!
Thank you very much!
this guy really understands what he is talking about, unlike the others! Thumbs UP!
From México, I agree with all the previous comments. Your explanation is clearer than my algorithms course. Great job sir!
So Mr. Abdul Bari has decided to single-handedly save me from all those unhelpful college lectures. Good, Very good. Thank you :)
you are one of the best teacherr ..happy teacher's day sir
Watched all your UA-cam videos from scratch. Teaching in that way, which is simple to understand and will also be quickly absorbed by the students is an ART. You have got this brilliant ART sir. I have grasped all these concepts before college via your videos. Thanks a lot for providing knowledge for free. You are a real teacher and i hope that you will continue teaching us more through your videos.
I develop, design and lead efforts for various initiatives at Oracle. Even with 13+ years of experience I come back to this amazing man to appreciate his simplicity.
Dear Sir,
Your simplicity in explanation is infectious. It motivates me to go back to college one more time and appreciate how amazing it is to learn from a teacher like you. God bless you. :) :)
Hey man , you work at Oracle ? 🤩
I did not no about this gem earlier. how easily he explain the things. thank you so much sir. May god give you all the happiness.
You are my role model in explaining concepts Teacher Abdul. Interesting, clear, and well-paced. I can't thank you enough for sharing this for free. I appreciate you and hope one day I can contribute to maintaining your courses.
Hi Professor Bari--THANK YOU SO MUCH for the videos!!! I'm currently a cs undergrad student taking basic algorithm, and I'm very confused by what I'm learning from school. But I'm so glad I found your videos because you made every algorithm SO CLEAR to me!!! I'm cramping for my midterm this coming Tuesday and having a meltdown because I'm so confused about the algos and your videos saved me. THANK YOU for all your great work!!!
Can relate. I have my midterms tomorrow. Where are you from btw?
@@SouhardyaSutradhar 🫤
Amazing! How come I have never thought of this solution! So trivial it seems but only when presented to you by such a master! Days, no Weeks of confusing and trying it on my own and now I see clarity! Amazing presentation!
I’m doing my master's in CompSci and these videos help me in undersyanding the working of the problems so well -- my prof is so so bad omg
Best algorithm teacher ever! Gotta love the dramatic way you turn to the camera at the end of your videos, when you know everything is explained and all the viewers understood!
The dislikes are from the lecturers/professors who can't teach as good as him.
🤣🤣🤣
No, few dislikes are because he just shows how algorithm works. Instead of showing how one can approach the solution without knowing solution already. Because approaching the solution is more important than mugging up solution. For example, he just showed the code for recursion without explaining one can think of writing that code without knowing the solution already.
@@kapilgupta8543 I think that cannot be taught. You just make tables with examples, fill them manually and try to see a pattern. That is my guess but I am not an expert!
@@kapilgupta8543 exactly
My madam explained it in more detail like him as well but I am going to these for revision. So, not every teacher is like u all thought if u listen to them carefully they will also cover all these topics
I have been struggling with LCS understanding and this person has made it look like a cake walk. This is the best explanation.
Bro can you explain to me why sir taken lcs as "ONE" and not a S in the Sequence Is there a reason in second question
The way he teaches is amazing.
I failed to understand this topic in my college but you are the man who helped me understanding this topic
I m first semester student of BVoc(software development and E governance)
Thanks sir 🙏🏻❤️
too good. I wish all the professor can do and explain like you, so I can understand LCS long time ago. Thank you so much
just want to say - WOW. Very clear description of LCS problem.
our college needs a professor like You Sir ji. Please Complete a series of PYQ of GATE C & DSA. ap hamesha happy and healthy rhe sir ji
I watched MIT lecture on dynamic programming multiple times but this 23 min video cleared all the doubts I have.
This tutorial is better than others
Great to see you here Sir, I have attended your classes in ACE for DBMS and CN in 2011 and let me tell you I still hold the notes from your classes and are very very helpful for any interview prep. Thanks a ton (bow)..!!! One suggestion I would like to give for this video is in case of DP solution if you could have explained how the code is derived that would have been more understandable.
Which college?
brother,if possible can you share the notes?if yes,do reply i'll send my mail id
Awesome .. The best part is that he spent good amount of time to clarify what is the 'actual problem' he will solve ... 10 / 10.
I really appreciate your way of teaching. Not even for a moment, you made me feel like this is a very complex topic. I have seen very few teachers teach this way.
This makes me think how to communicate better with my colleagues. I think the opposite person should not feel like it is a complex issue.
I am not even a computer programmer and I understand what he's saying! He's wonderful!
We can’t thank you enough sir. Simply can’t. Such simple and beautiful way of explanation of complex topics.
This man teached us a 2hour lesson in just nearly 30 min. 💐💐💐💐 Bravoooo
i saw many videos to solve lcs problem but did not understand, this is the only video that i understand, aap bahut accha padhate hai sir
After a horrible horrible lesson about this topic and leave with confusion, I am watching this video and finally understand the topic. Thank you so much ❤️
OMGSH, YOU MAKE IT SO CLEAR.
Thank you so much for all your hard work with finding the correct examples and making this video so neat and short, but complete. Thank you soo much!
I have tried multiple resources,but you are best sir.
Time investing here on this channel is worth.
Thanks you sir.
You are the best sir...one problem with ways solution..just great.
Lots of respect..
This guy is single-handedly giving us all our CS degrees despite the terrible profs some of us have in our algo uni courses! Props to this guy, liked and subbed 👌
This gentleman is teaching better than my Uni lecturers. He deserves special thank you.🙏🙌🥇🥇🥇🥇
Thank you mr.Bari. Last time I had watched your video , I picked up a very little. Now I could understand thoroughly because I had worked out this problem and it cleared my all doubts and I can apply it some other problems . Moral of the story is work out more problems and come to a such an intelligent teacher .
I thought I'd never understand this buy Abdul is an absolute lifesaver. Round of applause
after struggling through lot of documents, this video gave me complete and satisfying answer.😊
FINALLY! A video that doesn't have super-technical language and the entire method is so easy to understand.
Sir, what are subjects , you are teaching?
Your teaching method is best.
If I listen your video,
Then no class, no book is required.
this man is doing great job by helping students with his videos may god fill his all dreams. best wishes )-
Arey ye itna aasaan hai :) sir, huge respect... guru purnima pe apko naman hai
This man is a legend, cant say anything more!
15:04 for dynamic programming
TQ bro❤
bhai aapko geeli pappi
meri taraf se bhi geeli geeli pappi
One of the best Teachers for programming on UA-cam
Sir,
I saw this video after watching multiple dp youtube video but somewhere there was gap. But you're amazing, from today any topic first I will search in your channel.. You're too good if there is a match add 1 taking value from previous diagonal else max of previous row/colum.. Superb too good.. Bottom up, top down too good. I wish I watch this video before my amazon interview
There are lot of videos on LCS but this the best and clear explanation I've seen so far. Thank you and my respect to you sir.
Sir You are the best Professor I have ever seen teaching in this simple and effective way
Sir you are God Gifted. By only listening to your videos before exam brings back the confidence. Not everyone can teach as calmly and confidently like you! Thanks a ton for being saviour of so many students.
Just pure teaching
best in the whole universe
and also in multiverse 🛐
Never understood the diff between memoization and tabulation,thought they were both dp approach.I've just learnt it right now!Best explanation I've found on the internet till now!
Pay attention to how he uses plain recursion first, then memoization reduces number of calls(2^n --> m.n), and then he uses dynamic programming which is still O(m.n) but it outperforms recusrsions because recursive functions take a lot os space on the call stack and are generally slower tha for loops, every new way of solving the same problem adds to the performance, i used to jump directly to dynamic programming without understanding the problem it solves you can only truly understand(and appreciate) dynamic programming if you're coming from recursion
Never got this much easy explanation of recursion. Thank you so much sir for the video
Sir, you are the first person who made me think about dynamic programming so comfortably,....TONS OF RESPECT
Those dislikes are from people who are jealous of his easy teaching. Crystal clear explanation sir. Thank you ❣️
can you see my mistake ,i am geeting wrong answer
#include
using namespace std;
#define ll long long
// string dp[4001][4001];
vectordp(4001,vector(4001,""));
int main()
{
string s1,s2;
cin>>s1>>s2;
ll n=s1.length();
ll m=s2.length();
for(ll i=0;i
Sir, you are God. The way you explained the problem moving from Recursion to DP, explaining at each step the ways in which we can better the current solution, helped me understand this question which used to give me nightmares. Thanks a lot !
Sir is legend what my teacher couldn't explain in 3 lectures Sir explained in 23 minutes Hats off
sir you are best. this ALGO course cost me 24k. but my course faculty even don't know what he is teaching.
thnx sir
Best algorithm tutorials I've seen. Lots of respect!
I understood it right away watching this video after spending a long time to understand it from other blogs.
Seriously the way this guy explains is the best.
Just awesome!!!! My university's lecturer was failed to explain it and made it hard for everyone. You make it so easy as possible. Hats off sir!
You are the best sir, like someone said, congress has to give you a medal fpr spreading the light
Thanks sir, your explanation is awesome. I love how you explain every single step using hand writing. Clear concept, this is all I need, the rest is just need to convert it to any programming language. I hope you are always healthy there
Honestly speaking, this is better than Tushar Roy's explanation.
went to 3 places and here I found the simplest of explanation
Thank You Sir
Sir you deserve dhronacharaya award.... 🙏🙏🙏🙏🙏Bestest explanations
My lecturer just explained it to us vaguely. But now I see why some things happen.
Thank you Sir.
This man deserves a medal.
You are great Sir. Saviour of all students. Hats off to you. Thank you.
In my yesterday's exam, recursion and LCS weighed 24/80 marks. Your other videos really helped me. Thanks. Subbed.
Abdul Bari Sir I was revising using your videos all through 18th April night till early in the morning of 19th. Thanks for the work you do. Thank you.
Thank you sir you helped me in passing my exam
Probably u are the only one who have made such a large number of videos on topics related to competitive programming...lots of respect🙌 sir
Was Trying to figure this algo out. I have never seen anyone teach better.
I love you😂 I got this video in my recommendation 1 hour before my exam and this problem was the "hard" task of my exam :)
Thanks very much. That was crystal clear.
I have a remark though : as far as I know, ameliorating recursion with memoization is still considered DP in the literature.
exactly!! dp can be done using tabular method(bottom up) or recursion with memozation(top down). Got confused when he said now will do it using dp.
Sir, all your videos of ADA are really very well explained. I will pass in my exams only because of you....
Lots of respect and love to you!
Abdul is brilliant. Wow. I wish dp was as intuitive for me as it is for him.
Awesome explanations.
It would be better if you can explain why the addition is made to the diagonal element when a match is found and why the max of the other two is taken else. That helps in understanding the problem and solution deeper.
This is the greatest video I have ever seen. Thank you Abdul, you are the best.
This is the best explanation I have seen for LCS.
Please make more videos. Your explanation was the easiest to understand among all the videos I have seen for this algorithm.
Thank you so much, Sir. Your lectures helped me survive in my class during Covid-19:x
OMG, this algorithm is so awesome. And the explaination is crystal clear. Much appreciated!
Simply superb. I felt like your lectures were similar to ravindra babu sir's lectures.Both of them lectures are very useful to understand the concepts very clearly. Hands off
In simple words..Its WOW !!!
Perfect explanation..
You're the GOAT.
Hello Bari, you are one of my favorite teacher, and one of the best on youtube. Thank you for all your efforts.
Best algorithms channel on youtube.
LC explanation is the best i saw here. god bless you brother .
Thank you so much! Your explanation is awesome and easy to understand. professors like you are the ones who create the best students!🙌
23 minutes of pure teaching excellence
Lovely explanation, you have just explained in 23minutes what my teacher didn't explain in 2 hours :D
you saved my life Sir .. thank you very very very much .. //from KSA .
Hats off sir :) I have done my btech in 2010 that time i afraid to read DP but wen i started to read with ur videos they r quick one :)
Thanks to your lectures I can revise again