longest common subsequence

The longest common subsequence (LCS) is the longest sequence of characters or elements that are common between two or more strings or sequences, where the elements do not necessarily have to be contiguous or in the same order.

Explore

Requires login.