On Wed, May 27, 2009 at 12:58 PM, Martin Boese <boesemar / gmx.de> wrote:
> Got it ;-)
>
> Below the result.
>
>
> How? Instead of counting characters look for repeating sequences. Then
> think carefully about the long word that it finds. I used this (ugly)
> code:

Bravo :) Very nicely done indeed.

martin