4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming 

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.

Attended zero lectures but understood everything from you. I'm a fifth sem student and.....god bless you sir 🤟🤟🤟🤟.

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!

Anyone in 2024?

From México, I agree with all the previous comments. Your explanation is clearer than my algorithms course. Great job sir!

Watched all your RU-vid 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.

you are one of the best teacherr ..happy teacher's day sir

So Mr. Abdul Bari has decided to single-handedly save me from all those unhelpful college lectures. Good, Very good. Thank you :)

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. :) :)

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 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.

The dislikes are from the lecturers/professors who can't teach as good as him.

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.

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!

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

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!

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 )-

We can’t thank you enough sir. Simply can’t. Such simple and beautiful way of explanation of complex 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 🙏🏻❤️

studying 1 hour before DAA exam thanks to Abdul Bari sir

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 have tried multiple resources,but you are best sir. Time investing here on this channel is worth. Thanks you sir.

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

just want to say - WOW. Very clear description of LCS problem.

Arey ye itna aasaan hai :) sir, huge respect... guru purnima pe apko naman hai

I am not even a computer programmer and I understand what he's saying! He's wonderful!

This tutorial is better than others

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 ❤️

Thank you so much, Sir. Your lectures helped me survive in my class during Covid-19:x

I thought I'd never understand this buy Abdul is an absolute lifesaver. Round of applause

Awesome .. The best part is that he spent good amount of time to clarify what is the 'actual problem' he will solve ... 10 / 10.

Thank you so much for this amazingly clear explanation. If I had to pay in order to subscribe to you I would do so happily!

Thank you sir you helped me in passing my exam

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.

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.

This gentleman is teaching better than my Uni lecturers. He deserves special thank you.🙏🙌🥇🥇🥇🥇

Just pure teaching best in the whole universe and also in multiverse 🛐

Never got this much easy explanation of recursion. Thank you so much sir for the video

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.

Those dislikes are from people who are jealous of his easy teaching. Crystal clear explanation sir. Thank you ❣️

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!

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 :)

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

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

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, 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!

I understood it right away watching this video after spending a long time to understand it from other blogs.

Best videos on programming I ever found on youtube. Thank you sir, your videos are very helpful in competitive programming. :) After seeing your explanations, I can write correct code on my own. . . . ^_^ Lot's of respect. Please make videos on :- 1. Longest Increasing Subsequence 2. Longest Palindromic Subsequence 3. Edit Distance

Thank you so much Sir, I really wish you all the best. Easy demonstration and great explanation .. Wish I can give you the Golden Medal in Teaching.

One of the best Teachers for programming on RU-vid

You are great Sir. Saviour of all students. Hats off to you. Thank you.

Was Trying to figure this algo out. I have never seen anyone teach better.

hello sir as u cover all topics of algorithm...now next video series on the most imp domain of IT WORLD that is either IOT,ML,DL AUR AI

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

You are the best sir, like someone said, congress has to give you a medal fpr spreading the light

Sir is legend what my teacher couldn't explain in 3 lectures Sir explained in 23 minutes Hats off

you saved my life Sir .. thank you very very very much .. //from KSA .

Dynamic programming 15:05

Big Thank you. I don't know how I'd wraping up school if it wasn't for people like you 🙌

This man deserves a medal.

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

Thank you sir for your hard work .You are helping students like me all over the world . Great tutorial.

Lovely explanation, you have just explained in 23minutes what my teacher didn't explain in 2 hours :D

sir you are best. this ALGO course cost me 24k. but my course faculty even don't know what he is teaching. thnx sir

5:23 Abdul Bari: Then after that I will show how memorization will make it faster. Me: Memorizing the algorithm intensifies ROFL /s

Sir, You teaching style is the best till I have seen. I have never seen any other teacher who can explain so nicely. Your is very very much understandable and to the point. I am learning a lot from your RU-vid and Udemy website. Thanks a lot such a wonderful explaining.

Sir you are tooo good.... Loved your videos of Udemy course as well this algorithms course.

My lecturer just explained it to us vaguely. But now I see why some things happen. Thank you Sir.

In my yesterday's exam, recursion and LCS weighed 24/80 marks. Your other videos really helped me. Thanks. Subbed.

Sir you deserve dhronacharaya award.... 🙏🙏🙏🙏🙏Bestest explanations

It would be pretty helpful if can you make videos explaining the intution of how do you come up with the algo (code) in these problem, atleast for DP section

Very good start, but from 15:30 min on (bottom-up approach), things start to go south. 1. Why does the code have no base case? 2. Why trace values in a table? (if m, n ~ 1 million each, how to do anything from 15:30 min on?) 3. How to programmatically trace the characters in longest subsequence rather than visually looking at a table and drawing horizontal/diagonal arrows back?

You just saved my final test, thank you sir :')

I have no words.. Your teaching style is amazing awesome too good thank you sooo much Sir Allah bless You...…….

genius guy, clearly explained the hard question.

This is the best explanation I have seen for LCS.

This content is pioneering; much like a book that introduced groundbreaking ideas. "The Art of Meaningful Relationships in the 21st Century" by Leo Flint

went to 3 places and here I found the simplest of explanation Thank You Sir

Sir your simplicity makes you great. I wish someday i would meet you and touch your feet. 🙏🙏🙏

I don't know how I would cover my syllabus if you hadn't uploaded videos, your explanation is so clear, thank you from Nepal 🙏🇳🇵

This is the greatest video I have ever seen. Thank you Abdul, you are the best.

LC explanation is the best i saw here. god bless you brother .

Abdul Bari sir, hats off to you. Love from Bangladesh

sir please...longest strictly increasing subsequence...you explain things the best out of all of the videos that i saw on some of the tricky topics in algos....so please...

Best explanation in Internet for LCS

it can also be solved easily by using iterative approach. s1 = ['a','b','d','a','c','e'] s2 = ['b','a','b','c','e'] if len(s1)>len(s2): temp_list = s2 temp_list2= s1 else: temp_list = s1 temp_list2 = s2 print(temp_list) print(temp_list2) #temp_list.pop(0) #print(temp_list) def combo_finder(temp_list1,temp_list2): str = '' j = 0 for i in range(len(temp_list1)): while(j

It was a really great explanation, but you could explain on the approach you took to get to the dp algorithm rather than just saying bottom up and top down!

How simply you have taught everything in such a difficult topic... Thank you sir ...

In simple words..Its WOW !!! Perfect explanation..

sir actually i dont understand this concept when i am read it in book but after viewing your video i understand it clearly,nice explained sir,thanks a lot :P

This explanation was better than Leetcode premium explanation.

Abdul bari sir, super explanation sir, the best ever I had seen in my life.

Sir, the way you explain everything in detail is exceptional! :) Glad to find your channel! :) Thank you very much for all your videos which are truly insightful! :)

Searching for a topic and just hoping to find your video on that, cause no explanation can beat yours!! Thank you sir!

You are the best teacher!

you are awesome sir, reminded of my Teacher in school.

Greatly explained. Kudos, Sir.