Category: String

Implement Diff Utility

Implement your own diff utility. i.e given two similar strings, efficiently list out all differences between them.  

Longest Common Subsequence of K-sequences

The longest common subsequence (LCS) problem is the problem of finding the longest subsequence that is present in given two sequences in the same order. i.e. find a longest sequence which can be obtained from the first original sequence by deleting some items, and from the second original sequence by deleting other items.