Intermediate
Data Structures & Algorithms
Q63 / 100
What is the longest common subsequence (LCS) problem?
Correct! Well done.
Incorrect.
The correct answer is B) Finding the longest sequence of characters that appears in both strings in order (not necessarily contiguously)
B
Correct Answer
Finding the longest sequence of characters that appears in both strings in order (not necessarily contiguously)
Explanation
LCS finds the longest subsequence (characters in order but not necessarily contiguous) common to two strings. DP solves it in O(m*n) time and space.
Progress
63/100