Re^6: Challenge: 8 Letters, Most Words


We don't bite newbies here... much
	PerlMonks

by choroba (Cardinal)

on Oct 05, 2013 at 07:27 UTC ( [id://1057012]=note: print w/replies, xml )

Need Help??

One should probably postprocess the results if the winner is shorter than 8. I will look into it later.

لսႽ† ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ

Comment on Re^6: Challenge: 8 Letters, Most Words

Replies are listed 'Best First'.
Re^7: Challenge: 8 Letters, Most Words by choroba (Cardinal) on Oct 05, 2013 at 08:22 UTC
Something like the following? It slows the algorithm terribly, though... Read more... (3 kB) لսႽ† ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ	[reply] [d/l]
Re^8: Challenge: 8 Letters, Most Words by choroba (Cardinal) on Oct 05, 2013 at 11:28 UTC
Another idea: preprocess the input, adding all the combinations of the shorter words. Then run the original code without postprocessing. I will try to test it later, not much time at the moment... لսႽ† ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ	[reply]

Domain Nodelet^?

Node Status^?

node history
Node Type: note [id://1057012]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others cooling their heels in the Monastery: (2)

As of 2025-11-16 06:11 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

What's your view on AI coding assistants?

Results (72 votes). Check out past polls.

Notices^?

	• hippo	‥ epoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
	• erzuuli	‥ Anonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.