Longest Common Subsequence (LCS) Visualization
Find the longest subsequence common to both input strings
Text 1
A
B
C
D
G
H
Text 2
A
E
D
F
H
R
LCS Algorithm Properties
Time Complexity
O(m × n)
Space Complexity
O(m × n)
Approach
Dynamic Programming
Use Cases
DNA Analysis, Diff Tools