Search:

if you loop from highVal to highVal/10 for i and the same for j

you should always come across the largest possible palindrome first.

Chris

I see, I think I may have missed some bits here sorry.

However, given that you iterate in reverse, starting at max values, that means as soon as you calculate a palindrome, you have the largest...

Have you considered counting insteps of 11?

Chris