Longest Substring is a classic computer science problem: given two strings, find the common strings, then return the string(s) in common with the greatest length.
