Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re^2: Challenge: 8 Letters, Most Words (Update2:Then again :)

by Limbic~Region (Chancellor)
on Oct 04, 2013 at 19:18 UTC ( #1056920=note: print w/ replies, xml ) Need Help??

in reply to Re: Challenge: 8 Letters, Most Words (Update2:Then again :)
in thread Challenge: 8 Letters, Most Words

This certainly doesn't look like brute force to me.

First you get the words each letter appears in (regardless of how many times it appears). Then, you consider the top 8 letters based on how many words contain the letter but only allow each letter to appear once.

Your solution would probably be a lot faster if you also threw out any word from the dictionary that had repeated letter since I can't see how you would ever consider them.

Cheers - L~R

Comment on Re^2: Challenge: 8 Letters, Most Words (Update2:Then again :)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1056920]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (8)
As of 2015-12-02 06:45 GMT
Find Nodes?
    Voting Booth?

    My keyboard shows this many letters:

    Results (35 votes), past polls