Longest Common Subsequence - Dynamic Programming

Today we discuss how similar the LCS and LIS problems are, and go over a dynamic programming solution.

[@21kalee]

Many say "what" to do -- "Why" is answered here. Way to go UnderDog.

[@nourbouzid6376]

Great LCS/LIS tutorial, one of the best. Keep it up CSbreakdown, you've got a subscriber.

[@nebimertaydin3187]

best explanation so far!, great effort

[@CSBreakdown]

Thanks frfr frfrr! Glad you enjoyed it!

[@carloancellotti2890]

Great video!! It would be helpful for us if you also mention the time complexity for the problems with a small explanation. Thanks.

[@samarthseth6140]

The first video of CSB which i did understood, good job.

[@user-bq6bh9ku2b]

wonderful video!

[@rajhirani3876]

Superb wonderful explanation !!!!!!!!!!!!!!!!!!!!!!.............................

[@MuhammadUsman-it4mz]

Much helpful :)

[@Angel00Exia]

Thank you very much! I have one question: would the complexity be the same as that of edit distance O(nm)?

[@tc07client5]

Awesome!

[@effy1219]

excellent

[@ON-ne1rd]

What if you use a mix of both up and left arrows when you're borrowing the value from neighbors which have the same value?

[@johnmichaelkovachi3338]

This channel is fucking awesome!

[@AnantChowdhary]

Not sure how at 3:37 , case ii) is correct. x(k) may be equal to a(n) even though a(n) is not equal to b(m)

[@bynull]

Incorrect solution. A = z y x w x w z y B = w x y x z z LCS = y x z A string doesn't contain yxz

[@carloancellotti2890]

You are wrong. It is not necessary that the LCS should have continuous characters. The only requirement is that the characters in LCS should have their respective indices in increasing order in both strings. In the 'A' string, y,x,z occur at 2nd,3rd and 7th position respectively which are in increasing order.

[@nebimertaydin3187]

:D its common subsequence problem not common substring.