|
|
|
| Come for the quick hacks, stay for the epiphanies. | |
| PerlMonks |
Re^7: Challenge: 8 Letters, Most Wordsby LanX (Saint) |
| on Oct 05, 2013 at 14:51 UTC ( [id://1057041]=note: print w/replies, xml ) | Need Help?? |
|
Yeah I agree about 12_461_993 Anyway you don't need to check against all words in the dictionary, only taking the (at most) 256 subsets of a potential 8 letter combination. (less if letters are repeated) This can be done in a lookup in a prepared count-hash with normalized keys.
Cheers Rolf ( addicted to the Perl Programming Language)
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||