Longest Common Subsequence (2 Strings) - Dynamic Programming & Competing Subproblems
HTML-код
- Опубликовано: 13 фев 2019
- Code & Problem Statement @ backtobackswe.com/platform/co...
Free 5-Day Mini-Course: backtobackswe.com
Try Our Full Platform: backtobackswe.com/pricing
📹 Intuitive Video Explanations
🏃 Run Code As You Learn
💾 Save Progress
❓New Unseen Questions
🔎 Get All Solutions
Question: You are given 2 strings. Return the length of the longest subsequence that the 2 strings share.
Complexities
n = s1.length()
m = s2.length()
Time: O( nm )
We can upper bound time by the number of subproblems that we are going to solve.
Space: O( nm )
We upper bound space by the number of subproblems we will story answers to. Whether we do (n + 1)(m + 1) or (n)(m) doesn't matter asymptotically.
++++++++++++++++++++++++++++++++++++++++++++++++++
HackerRank: / @hackerrankofficial
Tuschar Roy: / tusharroy2525
GeeksForGeeks: / @geeksforgeeksvideos
Jarvis Johnson: / vsympathyv
Success In Tech: / @successintech 
Наука
![Megan Thee Stallion - Otaku Hot Girl [Official Audio]](http://i.ytimg.com/vi/USxIYOaIpig/mqdefault.jpg)
Table of Contents:
The Problem Introduction 0:00 - 0:25
What Is A Subsequence 0:25 - 1:00
Going Through Examples 1:00 - 2:37
Walking Through A Recursion Tree 2:37 - 12:00
Recursion Tree Finished: Our Answer 12:00 - 13:18
Dynamic Programming Table Walkthrough 13:18 - 13:43
What Are The Subproblems? 13:43 - 14:56
Defining Our Base Cases 14:56 - 16:24
Working On The Inner Table 16:24 - 22:49
DP Table Finished: Our Answer 22:49 - 23:27
This Is Not Intuitive At All 23:27 - 24:11
Time & Space Complexity 24:11 - 24:49
Subscribe Por Favor 24:49 - 25:11
The code for this problem is in the description. Fully commented for teaching purposes.
Like this time.
nice
Thank you for great explanation.
Seems like the link to the code is missing in the description.
I cant find the code :/
Where in the description is the code? I can't find it
somebody give this guy an oscar ...plz
haha
please give him....
@@arunsudharsan7437 ye
He surely deserves it. Till this date I was confused with the table thing, I mugged it up, but today I got it how each and every step is working.
Wrong award. The Turing award perhaps.
"okay. this is not intuitive at all. I'm going to be outright and honest."
-thanks for saying this. sounds relieving. 😂
it isn't lol
@@BackToBackSWE well, you made it really easy to understand.
You are a great teacher! 🙌
@@heyitsnikhil7956 thanks
The dp table explanation is the most beautiful thing I've ever seen
nice
That is right
It was almost like you were speaking directly to me when you said "Stay with me! Stay with me! I know it is confusing." Thank you so much for this thorough explaination!
lmao - and sure
I was so stumped when the problem was introduced, then at 4:22 it was like a bucket of genius water was dumped on my head. Genius!!
🚒🚒💧
This is honestly the best video I have seen on dynamic programming on RUclips. Mad respect to you for you for your down-to-earth, simple to understand explanations.
This is absolutely unbelievable that I just now found your channel. Thank you so much for all your hard work. Keep up the great work!!!
Yeah, RUclips probably won't pick up on this channel for another year or so but I'm ok with that. I'll keep going.
And yeah, this video took 6 hours to produce. You guys keep me going.
The problem isn't that I can't do these problems, it is that to EXPLAIN them WELL takes a lot of prep time. I have to code the solution, write teachers notes, shoot the video, edit the video, and publish.
But yeah, thanks
@@BackToBackSWE have you considered mentioning your channel in the cscareerquestions subreddit? I know it would be incredibly beneficial to a lot of people there
@@TeeheeTummytums503 Tried. Talked to the mods. I tried everything. They won't budge so I gave up. It makes me really angry but at the same time, it is fine. I understand their position.
I heard someone posted the channel once and it got like 50-60 upvotes and then the post got taken down.
I think they just don't like promotions but...I just have to grow this so big that no one can ignore it.
So that's what I'm trying to do.
PS: I honestly don't think the channel is ready though. I have HUNDREDS of questions and tens of topics left to cover in high quality and that will take a long time.
@@BackToBackSWE big L for them. Thanks again for all you do.
Hey guys here's another RUclips channel for Algorithm : ruclips.net/video/zmv4k6xNFGk/видео.html
This is the best explanation of LCS along DP available on internet.
thanks
This video was so good I almost cried... (tears of joy). Amazing work!
haha
Thank you so much. I have finally been able to understand Dynamic Programming Tabulation method. Most people when trying to explain it focus only on the table and don't explain how the code relates to the table properly. Now I understand it. You really have a gift for teaching, keep doing what you are doing. I will make sure to support this channel when I finally get a job
Nice, thx
I was almost about to give up on "Dynamic Programming" until I saw this video. Best video on the internet for DP !
Hats off man !! Commendable job
Amaze! keep hustling buddy. Try our 5 day free mini course - backtobackswe.com/
What sets you apart from other coding solving videos is the depth you go into and the effort you put in order that your audience would really understand how to solve the problem.
Well done!
ay, thanks
Thank you! You're like stackoverflow for leetcode. The place I look for help when I'm either stumped with a problem, or I've solved it but want the concept firmly set into my head.
great to hear.
I’m watching and practicing all your Dynamic programming, backtracking and recursion playlist and I can feel that I’m getting there (understanding, not memorizing). Thank you so much brother 👏👏👏🙏🏻🙏🏻🙏🏻
Thank you for taking the time to make this video. I feel like I never fully understood dynamic programing. The way you break it down clicked instantly with me.
I FINALLY understand. Thank you so much.
sure
Man, Can DP be explained any better than this? Hats off!!!! Thanks for all this stuff. Really made DP a cake walk for all us viewers...
nice
First creator with an american accent to explain to this level, this is best guy on youtube for DP explanations
I have gone through numerous videos but none of them could explain this problem in a level of depth like you did. Thanks a ton!
sweet thank you
I never comment on RUclips videos, but I have to for this incredible channel. The way you are helping me develop intuition for these algo problems is unbelievable. Thank you!
thanks!
You sir deserve a medal ! You are making all stuff i was putting a lot of effort into learning very easy to understand. Thank you
thanks
Ok. How easily you explained this is beyond words. Many can code stuff but very VERY rare can explain the way you did.
This problem haunted me for around 6 months and after this video I solved it without a sweat
I can officially say you have GODLY skills. Thank you so much!
I am going to spread this video (or your channel in general) to as many of my friends as possible. Please keep up the good work.
ok thx
Hi @Back To Back SWE I went through all the videos and was not even a single was as explanatory as you were.
Thankyou man you made my day.
This video is amazing -- can't believe how stumped I was at first until seeing you go through the table. Thanks so much for sharing.
thanks and sure.
The sheer energy and dedication of this guy is amazing, also outstanding explanation ability. If I had only had him as a teacher in high school man, I would have aced every single competition.
thanks....oh...and..................hey.
I like how when you explain, you keep us engaged. Keep up the enthusiasm!
Excellent explanation!
thanks, someone asked for this one so I did it (was going to happen this month anyway)
Thank you for all your hard work to make us understand DP better.
sure
Omg this is the best video that's broken down this type of problem I've ever seen! You've explained this so perfectly and having the first portion connect with the DP table in the second part felt like magic to me XD. This video (plus many of your others) will be watched for yearssss.
thanks haha
Your teaching style is best. Why am I saying this?
When you were going through the explanation the moment I was falling in confusion you were just there to tell "wait, this might be confusing but I will explain". This gave me the confidence and continued. DP was a nightmare to me. I just got what I wanted. No words to thank you enough. I am from Bangladesh, and I want to say my gratitude, man! Amazingly great explanation.
Thank you sooooo much for all your hard work..This is an incredible content.
sure, enjoy
OMG thank you!!! For the first time I feel like I've actually understood how DP works!
No problem!
You are single handedly saving my algorithms class grade. You explain things in a way that I understand a lot better.
Hell yeah!! Dude you rocked it. Thank you so much!! I love how you broke it down to the basic bottom up analysis!! Can't thank you enough!!
Finally, I could understand it. Thanks a lot for this awesome explanation. No one can explain it better.
thanks
U have definitely given a good explanation of this. I want this types more. Thanks a lot👍
sure
holy moly this is what im looking for. many guys on youtube just showing me the trick to fill the table, they never explain how memoization-table working! Only you explain the key of the memoization approach!!!!!!!!!!!
Once again, a superb explanation. Showing the relation of the dp table to the recursion solution was an eye-opener. Now I fully understand what's going on, which really seems to be the vital part of understanding these dp problems. Thanks very much.
You could use frequence vectors and do it in o(strlen(a) + strlen(b) + 26) time complexity and o(strlen(a) + o(strlen(b)) space complexity . It is easier more efficient and does not require DP.
ok
Dude this is the most amazing well-done explanation of DP that I've ever seen. I love u bro (big hug
hey
This is the only place where I found why the dp table contains n + 1 (+1 for empty strings) and how it corresponds to the intuitive recursion. Amazing stuff! Thanks a ton!
This is the most intuitive explanation I've come across for this problem please don't stop.
the boat is moving full speed ahead
i was gonna write that youre genius and the channel is underrated but then i saw that you have like a million subscribers(laughter emoji ) :)
thanks and we didnt have many subs for a while - this is the first comment I've read saying we have a lot of subs. This is like a pivotal point in external perception for the common watcher. Fascinating how things grow isn't it
WOWW!! You explained soo well. I wish you would my college professor .How can there be 19 dislikes????
lol ye
Those are probably collage "professors"
Amazing man. Simply amazing, your method of explaining is so simple and precise. Love the fact that you don't just jump into the code and tell "Oh it'll work like this".
sure, you're welcome
DUDE so thorough, entertaining, energetic. YUS. Need more of these videos man thank you so much for the work you do. I get DP now thanks to you!
nice. yus.
Really good job
hey
Hey Ben! Thanks for this! Could we extend this to actually find the Longest common Subsequence instead of just the length? Or would that be more of a backtracking thing?
Yes, we can read the dp table using the same logic we used to construct it to trace back the original solution.
The best ever video on this problem! While other people scream out that their playlist is the best, this man literally nails everything down!
Glad it was helpful! 😄 Also check out our FREE DSA Interview Prep Mini-Course - backtobackswe.com/ 🎉
Love your channel, how you are focused on setting one up to understand the problems and how to approach them.
DO YOU S E E ? great video!
hahahahahahaha, yes I have odd mannerisms. I cannot overcome them.
"JUST EXCELLENT!!!!!!"
ye
The way you break this down is the most comprehensive and easy to understand of any videos I've watched 🙌🙏. Thank you for your content sir
This guy is so good at explaining things! Keep it up, man!
Hey, what's your plan for this Valentine's day?
Benyam: To upload one of the most non-intuitve Dynamic Programming algorithm...
lol - was this video then
why can't my algorithms analysis class be like this? would you mind teaching at my university? ahaha
our teacher treats us like idiots, and I'm like hellooo you just don't do your job right!!
ye
yeah some suck
You are absolutely nailing explaining hard concepts that are not at all intuitive in such a simple and easy to understand manner! Keep up the good work!
thx
Dude you are AMAZING! Been trying to understand DP for a few days and I undertood it for once! Now I'm gonna keep watching your videos to see how to approach the other kind of problems. Keep up the good work!
Thanks! try out our 5 day free mini course backtobackswe.com/
"So what happens is, this is what happens, do you see what happend?
haha what
WHY CANT MY PROFESSOR EXPLAIN LIKE THIS? Thanks!
uh
This video is fantastic. The teacher assumes we know nothing and walks us through every step in plain language. Bravo!
Your videos really help a lot... I was struggling a lot with DP. Big thanks for making things easy to understand.
sure.
Do you have to come up with something like that in an interview by yourself?
probably not
0 dislike😎
:)
YOU'VE EXPLAINED IT IN THE MOST BEAUTIFUL WAY POSSIBLE! I LITERALLY WATCHED 7 VIDEOS BEFORE THIS ONE AND YOUR'S TRULY EXPLAINED THE PROBLEM IN THE MOST UNDERSTANDABLE WAY!! THANK YOU! KEEP UP THE GOOD STUFF!!
OK I WILL CAN I TURN CAPS OFF NOW
@@BackToBackSWE XD
The explanation is very clear and easily understandable. After listening to this video, I tried to code myself without seeing your code and finally I am succeeded in writing the code for this problem. Even my code looks different to your's but it worked. I really felt happy for that.
I think you made it harder than it already is. Why can't you just say your matching every char in one string to other in the matrix.and when at every point you will know how many have already matched and increase the count from their on.
It's amazing how lucidly he explains the problem. Keep going, sir, you rock!
ok thx
Thank you so much, I have gotten an intuition of how to do dp problems through your videos. The explanations are simple and easy to follow.
great to hear
Excellent! Excellent! Dynamic programming is my weakness, but little by little I'm getting my head around it. This video was super helpful in my quest.
This guy is the best there is. Thank you so much for your content.
wow! Really great content! Love the dedication to explain it as clear as possible!
I always had troubles understanding how to approach the question in general. This is great. Helps understand why we are doing whatever we are doing . Best video
great!
Anytime I'm stuck with some problem, I search it on youtube hoping that you or csdojo have already made a video about it. I know you might not read this but - thanks a lot you are making a difference.
i read everything.
Thank you very much for your videos! Your ability to explain hard problems is fantastic! Please keep going!
sure
You're the GOAT at explaining these algorithms and problems. Thank you very much
ye
THE BEST EXPLANATION EVER!!! Thank you!!!
You are an absolute legend. My teacher just did it without explaining anything. You nailed it. Thanks so much
thx
On a cell by cell basis:
If the characters are not the same, find the maximum value between the cell on the left and the cell above, and put that in the current cell.
If the characters are the same, do 1 + (cell[i - 1] [j - 1]), which is 1 + the value that is in the cell to the top left of the current cell. This is because we are essentially removing both characters like in the recursive tree (left to remove character from String Y, up to remove character from String X).
The final answer will always be the bottom right.
Thanks so much for the video!
Thank you man, one more well-known problem that became clear only after your explanation. Appreciate time and efforts!
great
Wow, this is probably one of the best algorithm videos I've seen on RUclips. Thanks!
sure
you rock!!! just found your channel and smashed subscribe button and gonna attend interview soon. thanks man!!!
nice, best of luck friend
The best video of LCS that I have ever seen so far
You have a great talent, honestly
thx
Fricking amazing lecture dude! I have been reading all other articles, Wikipedia and other youtube videos! That dynamic table was always too crazy to look at! Your explanation is the best to make this problem looks like a easy 2D table problem! Awesome!
I can never forget what i learnt from this video .. This is the power of your explanation and breaking down a complex problem into something so easy to understand.. Thanks a lot
Thank you, glad you liked it 😀
Do check out backtobackswe.com/platform/content
and please recommend us to your family and friends 😀
Thanks man I never understood how it worked and had just learned the recurrence relation. Now I actually got to know dp implementation of it. seriously best explanation video i have come around for this problem ever.
nice! glad it makes sense
Finally understood this. Thank you so much!!
I finally understand the thought process behind dynamic programming thanks to your diagrams and explanations. THANK YOU.
nice
you left me speechless man.. I've learnt this algorithm before too,but it was kind of learning the formula and making the table,even not knowing why was i making those table. Thank u brother
nice
This is the best explanation I have received so far on this problem ! Thanks a lot !
sure
The best explanation so far! Thanks man!
You're the only one who properly explained why we take the max value. Great intuition
This one is the best explanation i have found for this problem. Thank you dude, you are just awesome in the video, no video i found which explains the reason why to take diagonal element value to add with '1' when there is a character match.
Sure, got get em' 🐅
awesome awesome awesome. Really took the time to explain the nuances. much appreciated!
sure
Absolutely amazing explanation, this helped me understand the solution in a way that no other resource did. Thank you so much!
Thank you, glad you liked it 😀
Do check out backtobackswe.com/platform/content
and please recommend us to your family and friends 😀
This video deserves more views! Hats off! You nailed it!
thanks
This was an insanely good explanation. Much better and more in depth than my graduate algorithms course. Thank you!
Awesome explanation. nicely built up from base recursion idea. it was so easy to understand. Thank you so much!!
Sure
Man you made me cry. You made me understand the intuition of what DP is all about. I'd likely buy you a pizza right now. Thank you!
Cheers from Brazil!
Hahahaha, wassup from San Francisco, how's Brazil