Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

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

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


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

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

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1056999]
help
Chatterbox?
[Lady_Aleena]: ... Does it have to be that hard and complex to use to do a search on Netflix?
Lady_Aleena grumbles.
[Lady_Aleena]: I really need to get back into the swing of Perl. I'm forgetting things from lack of use. I don't know how behind I am too.
Lady_Aleena listens to the imaginary crickets.

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (7)
As of 2017-01-21 02:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Do you watch meteor showers?




    Results (180 votes). Check out past polls.