The letter D does not appear in all strings. In my challenge, I took advantage of the fact that every string contained the exact same 36 characters to take some shortcuts. All I meant by a general solution is one that doesn't have restrictions on the presence of every character in any one string appearing in every other string.HOUSEBOAT COMPUTER DOUBT
Obviously any character that isn't present in all strings can't be part of the LCS but there is no limit as to how many can be missing.
Cheers - L~R
In reply to Re^2: Longest Common Subsequence
by Limbic~Region
in thread Longest Common Subsequence
by Limbic~Region
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |