Longest Common Subsequence - Dynamic Programming - Leetcode
Longest Common Subsequence - Dynamic Programming
In this video, we will learn how to find the longest common subsequence (LCS) of two strings using dynamic programming. We will also see how to implement the algorithm in JavaScript.
What is the Longest Common Subsequence?
The longest common subsequence (LCS) of two strings is the longest substring that appears in both strings. For example, the LCS of the strings "ABCB" and "BDCA" is "BC".
Dynamic Programming
Dynamic programming is a technique for solving problems by breaking them down into smaller subproblems. The LCS problem can be solved using dynamic programming by first finding the LCS of the prefixes of the two strings, then using those results to find the LCS of the entire strings.
![[48FPS] [English Subs] Kobayashi san Chi no Maid Dragon S2 Shorts - Episode 05](https://images.videosashka.com/watch/AVO8qna_4HM)
