I found Hen Hanna's "packing" problem to be an intriguing one
Given a list of SeedWords: ['APPLE', 'PIE', 'APRICOT', 'BANANA', 'CANDY'] <<<
starting with Concatenated string 'ApplePieApricotBananaCandy'
Rem1 : if dropping a char still packs all of SeedWords, drop the char.
if we get stuck, possibly Randomly move a char (or do something else) Repeat.
Does this always lead to a shortest (all-packing) string?
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)