Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

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

by BrowserUk (Pope)
on Oct 04, 2013 at 20:00 UTC ( #1056925=note: print w/ replies, xml ) Need Help??


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

you have often a different and interesting view of looking at the problem.

How many dictionary words contain 7 repeats of the same letter? :)


With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.


Comment on Re^3: Challenge: 8 Letters, Most Words (Update2:Then again :)
Replies are listed 'Best First'.
Re^4: Challenge: 8 Letters, Most Words (Update2:Then again :)
by Limbic~Region (Chancellor) on Oct 05, 2013 at 04:01 UTC
    BrowserUk,
    You don't need 7 repeats to exhibit the problem:
    aabc aacb aabc aabc abca eefg efge eegf eegf efeg aabcxy eefglm
    Your code produces: a b c e f g m x: 0

    Cheers - L~R

Re^4: Challenge: 8 Letters, Most Words (Update2:Then again :)
by McA (Priest) on Oct 04, 2013 at 20:20 UTC

    I cite from the description:

    ...link to dictionary you used...

    :-))

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (7)
As of 2015-07-31 00:09 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (274 votes), past polls