Minimum length of a superpermutation
Statement
A superpermutation on symbols is a string containing every permutation of the symbols as a contiguous substring. Determine the minimum possible length of a superpermutation for every .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.