Longest Repeating Subsequence | Dynamic Programming | LCS

[@theghostwhowalk]

Just amazing. I so much like them that even after 2 FANG offers I am glued to these. Again all thanks to you for coding Qs. Kudos to also the fact while people are busy making paid sites, you are making this high quality content free to all aspirants via KZbin.

[@techdose4u]

Thanks for supporting :)

[@techdose4u]

Please ping me on LinkedIn

[@VinothiniAnabayan]

Crystal clear explanation, the first channel i prefer after seeing the problem statement. keep making videos

[@techdose4u]

Thanks

[@Kuriocity]

Came here after watching Aditya Verma's video ... best explanation!

[@zainabkhan9900]

in else if condition: not s[i][j] its s[i-1][j-1]; if we consider loop i=0 &j=0 then dp[0][j] &dp[i][0] not valid or if we consider loop i=1& j=1 then we miss 0th charecter of string.

[@Balaji-kg3ri]

The explanation is so clean❤️

[@techdose4u]

Thanks :)

[@gautamsingh3977]

Your videos are awesome! Keep producing these amazing videos.

[@techdose4u]

Thank you. Yea I will.

[@ajaywadhwa3398]

Wow Really Nice Explanations !!

[@techdose4u]

Thanks :)

[@mathewsjose1990]

you are great sir!

[@Kuriocity]

14:10 ==>> This is the tablular form where LCS of the 2 strings at a given index(2d) are not at the same index in original string

[@sayantaniguha8519]

Nice explanation

[@techdose4u]

Thanks :)

[@Aryansingh-fk7hy]

Sir, at 6:03, the string AXXX, why didn't you also consider x(3) -string-1 combined with x(1), string-2, they both x at 3rd index of string 1 and x at 1th index of string-2 are not overlapping by indexes.

[@jennieaayat9977]

I have same doubt

[@ashoksrinivasan4627]

I guess it may not overlap

[@samuelwilliams7331]

To have all 3 x's the indexes would have to match so you can only do 2.

[@rohandsouza9147]

Can we return the string value of LCS in same way as you did in the last part of the video ?

[@brennanfradelis9267]

Awesome video!

[@techdose4u]

Thanks

[@JavaLovers]

Nice video request you to please advise which software you using for display

[@syedkaja2045]

amazing vedio

[@techdose4u]

Thanks

[@adhaarsharma753]

It should be s1[i-1] == s2[j-1] in else if condition of the code which you have explained.

[@abdqadr]

That will be correct if he had added 1 to the length of row and col of the table

[@datastructure_solved5839]

Cleanest❤

[@summitjoshi7901]

A higher time complex approach

[@sayantaniguha8519]

Initialization Condition is done according to LCS/LRS logic ?... i.e., filling 1st row & 1st column of DP Table?

[@ritwik121]

yes

[@RaGa_BABA]

I dont understand the example of 'AXXX' .here the longest repeating subsequence is XX but no matter which index of X you take when repeating 'XX' one index will be common...please explain

[@bharathkumar5870]

look at the constraint,corresponding characters should have different indices in the main string

[@27-Joshna]

Thank you my doubt got cleared ..@@bharathkumar5870

[@parthpate1997]

How to declare lsc[][] 2d array in when we are returning string ? (I.e in second case )

[@techdose4u]

Did you try vector of vector of string ?

[@gautamsingh3977]

Hi Tech Dose, is this a leetcode problem?

[@techdose4u]

I din't find it on leetcode.

[@hashcodez757]

Uncrossed Lines

[@abhimani72]

what about aaa, isisi

[@syedkaja2045]

can we use the same method for forming lcs as you shown in this video

[@techdose4u]

Yea

[@theVSORIGINALs]

I EXPECT A REPLY ON THIS length is coming wrong in one of mine testcases ,n=157 expected =45,output=44 gjlapopkvxfgvicetcmkbljopgtqvvhbgsdvivhesnkqxmwrqidrvmhlubbryktheyentmrobdeyqcrgluaiihveixwjjrqopubjguxhxdipfzwswybgfylqvjzharvrlyauuzdrcnjkphclffrkeecbpdipu

[@techdose4u]

Hard to check this for me

[@ashwinvarma9349]

Please at least do a code walkthrough in the end🙏

[@techdose4u]

This was LCS so dint do it.