Longest common subsequence

Implementation of an algorithm which computes the longest common between two given character sequences.

findLCS()

/**
 * Finds the longest (one of, if several) common substring of two given strings.
 *
 * @param x X string.
 * @param y Y string.
 * @returns Longest common substring of X and Y.
 */
function findLSC(x: string, y: string): string;