On Fri, Jul 16, 1999 at 03:49:14PM -0500, Edward M. Perry wrote: > > This week's Weekend Edition Sunday Puzzle With Will Shortz on > > National Public Radio presents a problem of a class that can be > > defined as "match a substring of exactly n characters from the > > unordered set of discrete characters { c1, c2, ..., cn }". > > I heard a similiar problem which supposedly had just one solution. > A word with abcde in order but not necessarily contiguous: > > /a.*b.*c.*d.*e/ > > I would like to verify the solution, but alas, no dict on the system. > I found 10 words, which are variations on 3 basic words. 1 of the 10 is a non-inflected word, so that might be the solution that you had in mind. Ronald ==== Want to unsubscribe from Fun With Perl? Well, if you insist... ==== Send email to <fwp-request@technofile.org> with message _body_ ==== unsubscribe