Groups
Category
The Longest Common Subsequence (LCS) between two sequences is the longest sequence that appears in both, not necessarily contiguously.
Complete search enumerates every candidate solution, while backtracking prunes branches that cannot possibly lead to a valid or better solution.