Longest Common Subsequence Dynamic Programming | Explanation with Code

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the Longest Common Subsequence problem using dynamic programming. In this problem,

1. You are given a string str1.
2. You are given another string str2.
3. You are required to print the length of longest common subsequence of two strings.

#dp #lcs #dynamicprogramming

[neerajbhatia]

Sumeet Sir, Just Wow. I have not seen anyone explaining in such great length on the why of the solution to this problem. You are taking India's IT generation to next level and future is not far where lot many inventions and enterpreneurs can be foreseen using this type of education. Dil se Dhanyawaad, great wishes, happiness, peaceful life to you. thank you so much.

[micklemoon]

I saw another video of this problem of another guy where he started with the table that this video reached after 25 minutes of explanation. In that video, I understood nothing how the table was filled while in this one I did not need to watch further and could fill the table myself. Great explanation, totally worth were the 25 minutes.

[tushar]

What an explanation! Nobody explains the algo how it is made just provides them so that we can mug it. Perfect explanation thanks a ton

[deeksha]

Thanks a lot sir for explaining the problem in this much depth.This is the best explanation on LCS.

[adityatiwari]

Sir aap agar developer hote toh abhi mast bhar kahi PM rehte . But you chose teaching! Hats off

[iamredheart]

The best explanation on LCS. Thanks a lot.

[adarshdubey]

i don't know why this channel is so underrated

[madIndianHindu]

Great Explanation, I can bet that no one could explain this, better than you, after getting your explanation i never needed to see code, saved this for future reference, thanks Sumeet sir for such a wonderful video .

[SonuKhan-mpyn]

No words to appreciate, just amazing Thank you very much

[animeshkumarchoudhary]

This guy is explaining at another level

[vivekgupta_]

if there is any video of pepcoding of any question then it is best

[vedantingley]

Not able to see the proper playlist which was there previously..

[factswithai]

sir yahan tak phonchte phonchte ab maza aane laga hai dp mein, naye naye sawal bhi banne lage hain, thank u sir, and here comes a fact "east ho ya west sumeet sir is the best"

[abhayshekhawat]

sir your are legend no words every word fall short for you just love you:)

[uditbalyan]

This is best explanation. I have to come here again for understanding many other subsequences questions. 🙏

[indranilchakraborty]

Great work Sir .I'm amazed with your style and I am not a paid student but there is no difference I think between two...🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌.

[rajeev]

Sir itni mathematics ke wajah se kaafi confusion hogya h aur confidence low ho rha h.. like how can we come up with this deep maths behind a question?
I think sir yeh question ke liye pehle recursive solution fir wahan se DP ka solution wala explanation jyaada sahi rehta..

[angadrajsingh]

sir ye series thodi shuffled hai, please isko order mei arrange kardo, flow bana rehta hai concepts and learning ka . Thanks!

[piyushsaxena]

you are the beest sir
such an amazing explanation
keep making such videos sir

[y.so.sarthak]

sir hum kuchh bar dp left corner se right corner bharte haij kuch time me ulta
better hota agar hum left corner se right corner bharen har baar>>>>