Think about how you can generate all possible strings that contain all three input strings as substrings. Can you come up with an efficient algorithm to do this?

Check all permutations of the words a, b, and c. For each permutation, begin by appending some letters to the end of the first word to form the second word. Then, proceed to add more letters to generate the third word.