It sounds like an algorithmic problem, typical of what you can find in coding competitions. You have two strings, A and B, and a list of strings L. Find the lo

It sounds like an algorithmic problem, typical of what you can find in coding competitions. You have two strings, A and B, and a list of strings L. Find the longest substring that appears in both A and B but not in any element of L.