Re: Code Shortening (golf)

[eyepopslikeamosquito]

My general golfing advice is to try to use $\ as the accumulator if you possibly can because you can then print it with a bald print.

For example, this one is six strokes shorter and gives the same result as yours for the three test cases given at the spoj web site:

$\+=~y///c&3for<>=~/([a-z]+)/g;print

Don't know if it's generally valid though.

[Young Monk]

It will fail for a test case like AB for which, it must be A---B, (ie) output is 3.
In my solution, decrementing 3 from the result is necessary. So, a bald 'print' cant be used! Any suggestions?

[eyepopslikeamosquito]

So, a bald 'print' cant be used!

To be a competitive golfer you have to be tenacious, devious and challenge assumptions. So I wouldn't rule out using a bald print just yet. At least, not without first trying to find a way to adjust your algorithm so that it can be used.

For example, why do you subtract 3 at the end, as in print$n-3? Is that to compensate for adding 3 when you (always) match at start of string? If so, you could try to eliminate the need to subtract 3 by adjusting your regex to not match at start of string.

In any case, I suggest you study every line of perlre looking for something, anything, that might help you shave a stroke. That is the attitude required to win at golf.