Longest Common Sequence

$($

LCS

$)$

$$is the longest subsequence that is common in two given sequences, provided that the elements of the subsequence are not required to occupy consecutive positions within the original sequences. LCS is used in compressing genome resequencing data and to authenticate users within their mobile phone through in

$-$

air signatures

Implementation:

Define Function: find

$\_$

lcs