FOGIEMYONSNSASIASOGEHNONNSEFSWINKHKSN
FORGVEMMNASLOFGIETHNOSESEFTHEWHHNTEYTLSENS
RGIEMENNENSESFORGVEHENOEOHOEHOTHIEYAKSEE
[/code]
so that they may overlap only at
letters they have in common and
together they form a witty English
sentence. This sentence also has
the shortest possible length of
any string made by overlapped
interleaving of this kind.
Here is example solved problem of
this type:
Suppose that the three strings were
Each of these can be stretched out over 70 positions
so that each of the 70 positions is covered by a
letter from at least one of the three. Furthermore,
letters at positions of overlap must agree:
S SNO A I T AYIN U ITIS L S RA V O HEKINDO P EM E UZZLEI
SI OT W TT S BUTIT SI LU ATIVE FE HEKI P BL MTH U ZLE S
THI I AWITTYS Y G UT TIS LL ST T FETHEKI OFPRO EM H PUZ LE
THISISNOTAWITTYSAYINGBUTITISILLUSTRATIVEOFETHEKINDOFPROBLEMTHEPUZZLEIS
[/code]
This 70-long string, although not unique, is as
short as possible while fulfilling the requirements
Question
superprismatic
Interleave the three strings
Link to comment
Share on other sites
2 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.