Consider a set of strings S that contains a binary representation of numbers from 0 to 99. What is the shortest string T such that every element of S is a substring of T?
What you are asking for is very similar to the De Bruijn binary sequence . An algorithm for this problem using Euler loops can be easily adapted to solve your problem.
Source: https://habr.com/ru/post/1481886/More articles:grunt-contrib-concat: how to use the "process" option - javascriptset initial auto increment value for id in django model - pythonGoogle Map V2 at the top of the Android screen and viewing the list at the bottom of the Android screen - javaShortest Bit Sequence Logic - algorithmCannot Uninstall NetBeans 7.3 - uninstallCSS horizontal scroll bar - htmlPrinting int values ββwith custom padding? - cWhere to use event aggregator in puppet? - backbone.jshow to prevent a deadlock when you need to block multiple objects - c #Marionette event aggregator vs backbone router - javascriptAll Articles