Longest common subsequence algorithm -- example

[@4blossoms]

Great explanation. My prof didn't teach it this way, but makes the dynamic programming solution so much clearer!

[@AbdulwahabSWE]

8 years later and his solution is better than my prof😂

[@techvishnuyt]

@@AbdulwahabSWE same 😂

[@bigray712]

you should make more algorithm videos. you're really good at explaining.

[@backup3412]

Yes we need more

[@עומריפיינגולד]

listen man , this is the best shoki in thw world i understand everything but shir doesnt understand but now she will understand so slozki is the world have a good night

[@desideriaionescu8693]

Hello! I stayed all day to read and understand this method, and nothing...then, I found your video and I have understood. It is the best explanation!! I will be happy if you will put the algorithm in C++, as soon as posible. Thank you a lot!!

[@kanakanakanakanameki2055]

wow I understand this very easily. thanks. the other explanations are too complicated and I don't have much time to study lol

[@shanekhantsoemoe4996]

Thank you so much! I want to see more algorithm videos from you as you're really good at explaining them!

[@princemaratas3531]

I know it's late but I want to give you a very big thanks. this video really helps me understand how to code the LCS. that I used in Undergraduate Research :)

[@Nikhil88able]

u did a gr8 job!!... just took 8 mins and several questions of LCS SOlved...:)

[@jalupo]

Thanks bro you just saved my CAT tomorrow😇

[@pchebbi]

Wonderful explanation! You are a great teacher!!!

[@animexd6394]

Thanks man it's great explanation of the algorithm i read some blog about it but they always make stuff complicated for no reason.

[@camaulay]

Great! Very clean explanation. Thanks mate

[@santoshjoshi7890]

thank alot,Daniel Sodkiewicz very simple to understand

[@bryantwalley]

This is good. Thanks for taking time to put it together.

[@gopeswarnamasudra8895]

please upload more videos on (dynamic and greedy) algorithms, You are a great teacher

[@jackolaslock]

Thanks for this video. I needed to see it being done to really get it.

[@ChiranjeevTapas]

can you teach this to my teacher too??
damn she made this so difficult to understand!
Dhanyawad(Thank You)!

[@TheMoviesManX]

My teacher is the same !

[@anishkhanal5108]

Yo fckin same here...i hate my teacher

[@diandhonalciranjang222]

same with me, my prof is always make anything dificult..

[@josephkatsioloudes9101]

Thank you so much for this explanation, my teacher was for the κάτσαρα!

[@cheicktraore5062]

Ya vid help me a lot during my exam thank you so much 🙏🏿

[@shivamkhandar5737]

Very easy and understanding method sir keep it on

[@Pathorkuchimon]

if u go UP and LEFT its BCBA
if u go LEFT and UP its BDAB
2 answers !

[@zubairshahri2588]

Tufayel Talha how to correct it then

[@tomm7273]

The algorithm only gives you one of the longest subsequences. If there are multiple, taking different paths will give different subsequences. If you want all of them, you must traverse all paths.

[@nguyenthanhdat93]

I think It is okay to have two answers as long as the solution is optimal (one of the longest sequences).

[@SnoozeDog]

good catch!
There are only 2 answers if Left and Up are the same length and no diagonal exists on that entry. Since to get to that point you had to choose between 2 strings of equal length, thus both paths must be taken to derive answers

[@ShubhamGupta-dz5bn]

Perfectly done!! Helped a lot!!

[@Thushan44]

Thanks mate! This is gonna help me a lot in my exam tomorrow lol

[@rakeshraih]

perfect, nicely done. you rock man

[@roboarif]

Great work... I could not understand a thing when this was taught in class. But i understood perfectly here.. I m still confused why i could'nt get it in class :/

[@i_dont_want_to_use_handle]

Thank you!!!!!
공부중에 LCS가 이해가 전혀 안 됐었는데, 덕분에 이해가 되었어요! 정말 감사합니다!!!

[@dickyzuerst2828]

thank you so much sir, finally i can understand it more better

[@PriteshParekh77]

Awesome explanation.Fount it very helpful.
Thanks mate.

[@ghostfacekillerist]

Thank you for your video! Helped me before a test!

[@OneShotLegacy360]

Thank you. Saved my life.

[@SmashedRadio]

You did well, sir. Very well. Thank you

[@shrikantlondhe]

Nice and quick explaination, thank you.

[@sohamc7402]

Great work i wish you did more videos :)

[@TheHappieCat]

This explains it so well!! Thank you!

[@HabiburRahmanHabibur]

Thanks and good work but
I think ,there are 2 LCS is possible from the table you created. so, If you show all the possible LCS ,it will be good .

[@hridoyth8866]

Thanks for such an awesome explanation

[@hootis8]

Great video, you explained everything very clearly, you saved my ass

[@dhhsncnd6107]

The logic is simple here, let LCS [i,j] represent longest common substring of a[1...i] and b[1..j].
if (a[i] == b[j])
LCS[i,j] = LCS[i-1,j-1] + 1;
else
LCS[i,j] = max(LCS[i-1,j], LCS[i,j-1]);

[@faken143]

Nice tutorial! Than you Daniel.

[@gianlucarosadini1163]

Dude you are the best... Thank you!

[@kouamelan87]

nice you explained in a very simple manner. thanks

[@piyushgoel3020]

Simple explanation. Thanks

[@senthilkumaran7936]

Thank you very much, that was very lucid.

[@kopiro]

Great explanation. Thank you.

[@anesp.a913]

Hi Dear Sir,
A great work you have done , thanks alot
Anes

[@punstress]

So the subsequence doesn't have to match exactly, just be in order? One has BDAB but the other has BDCAB.

[@DanielSodkiewicz]

Yes, you are correct

[@tonyzhangable]

Thank you! Very clear explanation!

[@ShroomsUnited]

Nice explanation, thanks!

[@prajaktadeosthali3083]

Thanks a lot for this video!

[@supriyamekala8805]

Superb Sir

[@doosc]

Are the tracking results the same if I swap rows and columns?

[@sundusali9293]

very well explained. thank you

[@rachitranjan]

Thanks ..You made it super easy...

[@sakthivelpalanivelu3833]

Thank you so much. Very nice one.

[@dighechinmayt]

Thank you daniel.U made it easy

[@be_55_atharvsankpal38]

7:35 u went to top twice didn't follow top left sequence

[@lucumu]

another awser is BCBA，Which one should we choose?

[@horsefeather]

Why does the LCS of ABCB not work as well? I also noticed that you found this exercise in the Introduction to Algorithms textbook which I am currently using for my course.

[@DanielSodkiewicz]

yes, there are few correrct solutions

[@donovankeating8577]

Why do we have to get the max of L[i-1][j] and L[i][j-1] if no commonality is found? Is it because of the 0's in the first row and column? Because for other cases, the max is always the cell to the left. Am I right?

[@mallikanaik14]

This was really helpful!! Thanks!!

[@1SSW]

Hi there, are you able to do a video on Boyer Moore pattern matching algorithm with last occurrence table

[@SRIHARSHAVARADA]

nice..!
Easy to understand..!

[@sumita913]

Thanks so much! this totally helped me understand!

[@AdamAdam-yo3oh]

Such a great tutorial.

[@boyadeng7127]

It's a great illustration.

[@jenilgadani1491]

helped a lot..thanks for uploading it :)

[@InvitusCode]

thanks for sharing, you saved my day! =)

[@shubhamupadhyay4695]

thanks a ton man..This helped alot.

[@jmdryden]

thanks! super helpful.

[@parasmalhotra7633]

nice and concise..

[@richatiwari4043]

very nice explanation :)

[@LUX1111111111111]

just curious did u film it with ur cellphone

[@DanielSodkiewicz]

LUX1111111111111 indeed :)

[@Princebharti9971]

nice explanation !

[@sruthysathyanandan7268]

thanku sir....u taught well

[@shocolate0104]

Thanks! found it helpful!

[@babanparab2370]

thanks sir very nice explanation

[@hayaaaa9273]

Nicely taught

[@hsuyusi8350]

thank you, it's a great video !!

[@BrimozDDdDdD]

very consise, much appreciated

[@swarajingle7639]

awesome vid 👍

[@guywithspectacles]

THANK YOU SO MUCH MAN YOU ARE LOVE YOU ARE LIFE... COZ U JUST SAVED MY ASSS FROM FAILING XD

[@SamraatMaharjan]

absolutely thanks bro

[@gioduduchadze2430]

couldn't we go from ones to zeroes on CB? there was a bridge over there or if there's a chance to go left or top we should use it always?

[@DanielSodkiewicz]

When you start in the corner, you decide if you will follow a pattern left top , or top left and you follow that for the entire journey, To answer your question: if you can go left or top - yes, you must go this direction.

[@avibhav265254]

thanks alot....kindly teach my teacher if u can.....

[@amitavital]

Omg i love you
its help me so much

[@yasaswinichanda4257]

perfectly tailored till required

[@daniellevi396]

How is that the LCS? BDCABA doesn't contain BDAB... am I missing something?

[@lightion7746]

+Daniel Levi it is not necessary for lcs that letters or pattern should be consecutive it should be continuous for e.g., here BDcABa contains BDAB

[@ragulkumarrajendran4251]

Nice one man

[@semirek]

Thanks a lot!

[@markmontejo1726]

thanks for this video sir :)

[@maphioso]

thank you so much !

[@qu3ntin]

but how is BDAB a subsequence of BDCABA?

[@itishreesahu8745]

Thank u so much....👍👍

[@PaTTaMoNE]

Thank you for your video. I am very grateful.
You have helped a lot. :D

[@Melaf90s]

Think you so much

[@sakuray7]

Thanks!!!

[@melihekizce2318]

I found another two results.
Result 1 is: B,C,B,A
Result 2 is: B,C,A,B
Result 3 is(your result): B,D,A,B

[@doosc]

I found the BCBA. Can there be multiple correct answers in LCS?

[@melihekizce2318]

@@doosc I guess yes

[@md.shafaatjamilrokon8587]

thnks.lve frm Bangladesh

[@hasimkeskin8521]

AWESOME!!!!!!!

[@SaurabhGupta-bl5bb]

Nailed it !