What is the shortest string $S$ over an alphabet of size $n$, such that every permutation of the alphabet is a substring of $S$?
I thought of this problem while reading a open problem on shortest supersequence of all permutations.
What is the shortest string $S$ over an alphabet of size $n$, such that every permutation of the alphabet is a substring of $S$?
I thought of this problem while reading a open problem on shortest supersequence of all permutations.