String
Longest Common Prefix
An algorithm for finding the longest common prefix among a set of strings.
- Time complexity is Linear, i.e. O(n)
- Space complexity is Constant, i.e. O(1)
Longest Common Subsequence
An algorithm for finding the longest subsequence common to two sequences.