Challenge: Longest Common Subsequence
Explore how to find the longest common subsequence between two strings by applying dynamic programming concepts. Learn to distinguish subsequences from substrings and develop an algorithm that returns the length of the longest common ordered subsequence. Build from recursion to dynamic programming solutions while practicing problem-solving skills.
We'll cover the following...
We'll cover the following...
Problem statement
Given two strings, find the length of the longest common subsequence between them. A common subsequence in a pair of strings is a sequence that follows the same order of characters, but the sequence does not necessarily have to be contiguous. For example, two strings two and too ...