in reply to Re: Simple regex wordlist question
in thread Simple regex wordlist question
I think he is working on the puzzle where you think of as many words that can be spelled using letters in the given word. But what about quantity?
I've already given ++ to Zaxo and CountZero for their anagram solutions, but I'm not sure now that's the point
An example would help, but if I'm right, he wants, given 'PerlMonks' a list like:
Is this what johngg has?
perhaps vcTheGuru is closer to right with Math::Combinatorics, except maybe using the combine function looping from 1..($#input+1).
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^3: Simple regex wordlist question
by goibhniu (Hermit) on Sep 11, 2007 at 21:00 UTC |