This module implements the Longest Common Subsequence (LCS) algorithm.
The LCS problem is finding the longest subsequence common to two sequences.
It differs from the problem of finding common substrings: unlike substrings, subsequences
are not required to occupy consecutive positions within the original sequences.
This implementation handles Unicode strings efficiently and correctly, ensuring
that multi-byte characters are managed properly.