Lesson 2

Problem. We want to find a string that contains (as substrings) all of these strings: \(\texttt{abe}\), \(\texttt{dfa}\), \(\texttt{dab}\), \(\texttt{eca}\), \(\texttt{cbd}\), \(\texttt{acb}\). For example, we can concatenate all the strings: \(\texttt{abedfadabecacbdacb}\). But there is also a shorter string containing all the required strings: \(\texttt{abecadfaacbdabcbd}\). What is the length of the shortest such string?