Longest Common Subsequence Dynamic Programming : Interview question

Write a program for finding out the longest common subsequence between two strings. Dynamic Programming.

[arjun]

Vivek -- I don't know what I would do without your explanations. You are the best algorithms teacher on YouTube. You are the best I've ever seen. Keep doing what you're doing, it's helping a lot of people!

[kennash]

Sir, Your videos on Dynamic programming are awesome. Please make following videos if possible, Sir :

1) Given a string, determine if a permutation of the string could form a palindrome.
2) Count All Palindrome Sub-Strings in a String
3) Find all distinct palindromic sub-strings of a given string
4) Longest common substring
5) Longest Palindromic Substring
6) Print all palindrome permutations of a string
7) Print all palindromic partitions of a string

[lawbindpandey]

One of the best Algorithm teachers available on you tube !! Simply, loved it !!

[AnandKumar-wkos]

This video clear all confusion of LCS .
well explanation

[quangle]

Thanks Vivekanand for your nice video. In my opinion, you should provide some explanation to the audience about why
- choosing the diagonal cell + 1 in the case of two characters are the same (for example LCS(x[m], y[n]) = LCS(x[m-1], y[n-1]) + 1 and (m-1, n-1) is the diagonal cell position);
- choosing the max of the upper row, same column as LCS(x[m-1], y[n]) and same row, left column as LCS(x[m], y[n-1]) when two characters are different.

[footballgeeks]

Haven't seen better teacher than you. Thanks for your 📹 🙏🙏

[neerajkashyap]

Very well explained.It was easy to understand LCS after watching this video.

[premprakash]

really you deserve it.you teaches in so simple and easy manner.

[SanthoshKumar-njmm]

Great Explanation sir.This is really useful for many please dont stop this

[rebelutionarygaming]

I like your explanations. Also its nice to see how you have changed since early videos like this till now. Looking forward to new videos soon.

[Karan-mses]

Please discuss the time complexities as well with each algorithm. That would be really helpful.

[sonampahariya]

The Algorithm code needs a correction as it can through array limit exception on line 4/5 T[i][j] = T[i-1][j-1]+1 when i=0 or j=0.

[ΑντρέαςΣωτηρίου-πγ]

you are a beast please expain more topics on programming

[kirankumarj]

sir, the question is
find the number of characters that can be removed in the given string to make it a palindrome. using dynamic programming
We have to return the count sir.
Eg :
input1:mabm
output1: 1(explanation: by removing b we get palindrome)

input2: abbbcdae
output2 : 3(explanation: by removing c, d, e we get palindrome)

[asifnaqshi]

Great explanation !!! But it would be great if you can explain how this algorithm is derived !!!

[reassume]

How to stop sleepiness?
Give an algorithm. I want to wake up all day and night and study.

[GagandeepSingh-zmch]

please tell why are u taking diagonal +1 if elements match and maximum of above and left elements if they are different....!!!!

[gopaldas]

sir, your video is very easy to learn...sir please upload more videos on algorithm...please sir

[benvahaba]

at the end of the video the algorithm is a little wrong because if i=0 and j=0 and str1[i]==str2[j] than you cant do T[i-1][j-1]. ty very much for the video though. really helped me

[quickvideos]

You are best. I really mean it.. Keep it up.