Subsequence Identification in Three Strings

A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements. The Longest Common Subsequence (LCS) of three strings is the longest sequence that appears in all three strings.
Step 1: Let's visualize our three strings
String 1:
A
B
C
D
G
H
String 2:
A
E
D
F
H
R
String 3:
A
B
D
F
H
R
Longest Common Subsequence: