Dynamic Programming, Programming, Algorithms, Data, Coding Interviews.
0 => A 1 0 1 => AC 1 1 0 => AB 1 1 1 => ABC If we have m size string then total count of m size bianry numbers will be 2^m. One basic idea would be to explore all possible subsequences of both strings, compare each subsequence of X with each subsequence of Y and find the common and longest among