MOTMMNEEITEAEOENANU
HWOCOMNTSNWOLRYDGSI
TETSOLEHRDHRDTPIDTY
[/code]
so that they may overlap only at
letters they have in common and
together they form the shortest
possible string (not necessarily
an English sentence).
Here is example solved problem of
this type:
Suppose that the three strings were
Each of these can be stretched out over 45 positions
so that each of the 45 positions is covered by a
letter from at least one of the three. Furthermore,
letters at positions of overlap must agree:
HE GO O MOASUTYPO A T HII
EISPLL IH TO PRLM T HTSS
RADE XA EF OTON T OEEFB E
Question
superprismatic
Interleave the three 19-long strings
Link to comment
Share on other sites
8 answers to this question
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.