Algorithms: longest common subsequence (dynamic programming example)

Published: 02 January 2021
on channel: Frank Stajano Explains

950

This video is part of Professor Frank Stajano's lecture course on Algorithms at the University of Cambridge.

This video contains a third example of dynamic programming in action. Today's problem is to find the longest common subsequence between two strings.

If you find my lectures useful, give the videos a thumbs up. Subscribe and hit the notification bell for more of the same and to encourage me to publish more videos for budding computer scientists. Leave your comments below.

Course web page:
https://www.cl.cam.ac.uk/teaching/cur...

Course handout:
https://www.cl.cam.ac.uk/teaching/202...

My home page:
https://www.cl.cam.ac.uk/~fms27/

On this page of the site you can watch the video online Algorithms: longest common subsequence (dynamic programming example) with a duration of hours minute second in good quality, which was uploaded by the user Frank Stajano Explains 02 January 2021, share the link with friends and acquaintances, this video has already been watched 950 times on youtube and it was liked by 70 viewers. Enjoy your viewing!