Longest Common Subsequence - Dynamic Programming

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

[kalee]

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

[nourbouzid]

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

[samarthseth]

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

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

[nebimertaydin]

best explanation so far!, great effort

[CSBreakdown]

Thanks frfr frfrr! Glad you enjoyed it!

[ON-nerd]

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?

[AngelExia]

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

[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