DP - 6: Longest Common Subsequence

[@ayushjauhari8953]

It's quite good that you explain both the top-down and bottom-up approaches in your videos.

[@CodingSimplified]

Thanks for your nice feedback. Sure, I'll take care this.

[@Dyslexic_Neuron]

This is a good comprehensive channel . Hope it gets numbers of subscribers it deserves

[@CodingSimplified]

Thanks.

[@anandjha5353]

Your explanation is really awesome. God bless you. Thanks a lot for these videos.

[@CodingSimplified]

Thanks. Keep Watching.

[@tharunprabakaran]

Best example in KZbin for LCS

[@CodingSimplified]

Thanks. Keep Watching.

[@kumar41440]

This is the only video you ever need to watch to ace this leetcode question: leetcode.com/problems/longest-common-subsequence/

[@CodingSimplified]

Thanks. Keep Watching.

[@AyushKumar-vh7pg]

Thank You so much for your effort Sir, Please add more videos on DP and if possible please add them fast.

[@CodingSimplified]

Sure, will try to add DP videos on regular basis, today also we've launched DP-7: Longest common Substring

[@xavier4107]

I got another way... First we'll store all subsequences in arraylist... Then check for longest subsequence using 2nd string & each string from arraylist using .contains() method...

[@sathwikkuppam713]

You explain very well But at the beginning of the question please give us some 4 to 5 test cases so that we understand better

[@CodingSimplified]

Thanks for your nice feedback. Yup, that make sense. Sure I'll add more on it.

[@anandbalaji8136]

Hi Sir, Waiting for next video:)Thank you very much for your contributions..It really helps a lot!

[@CodingSimplified]

Thanks for your feedback. Sure, tomorrow I'll be launching next video on DP.

[@kukroid6873]

Can you pls explain this part again 28:19 I am confused how are you checking a 2d matrix. When you are checking for 'b' you should check for : (b,a) - > 0 (b ,ab )-> 1 (b, abc) -> 1

[@CodingSimplified]

If you see in 2nd row, we've 'b', now we'll compare this with all values in column a, b, d so basically in this row, we'll compare b - a, b - b, b - d & as per equality we're updating values. - Now effectively what they're suggesting is when I'm in 2nd row it means I've already covered 'a' which was in 1st row, so we've ab in 1st string & now In 2nd string we've characters as we're moving column wise so 1st effectively it represent (ab, Null) (ab, a), (ab, ab), (ab, abd) (ab, abde) - Please see video again if you've confusion. Thanks.

[@kukroid6873]

@@CodingSimplified Thank you so much. That makes sense

[@Dyslexic_Neuron]

The recursive runtime should be 2^n + 2^m and not 2^(n+m)

[@CodingSimplified]

Time complexity of recursive is exponential of the power 2, so it's 2^n, but as we've 2 strings, so it's 2^(n+m)

[@Dyslexic_Neuron]

@@CodingSimplified but they r two different recursions right ? Why should they be multiplied ?