Consider a string of three successive letters in reverse order – like zyx, kji etc. Our objective is to add some letters before and after the string to form a valid word.
What is the longest word formed by this process?
PON would seem to be the most productive starting point for generating a list of possible words.
corresPONdences, sPONtaneousness (15)
counterresPONses, unresPONsiveness (16)
There are some good options with UTS (oUTStandingly) and FED (antiFEDeralist), but none of length 18 that I've found yet.
Posted by Jyqm
on 2015-07-10 16:07:50