Welcome to Day 6 of the Perl 6 One-Liner Advent Calendar! As promised yesterday, today weâ€™ll be solving problem 4 of Project Euler. Let me once again remind you that you can pause reading and solve the problem yourself first. My intention is to demonstrate the beauty of Perl 6 and Perl in general.

So, the task is to find the largest palindromic number (the number that reads from both ends, such as 1551), which is a product of two three-digit numbers.

In other words, we have to scan the numbers below 999Ã—999, and could optimise the solution, but in reality, we only have to allow numbers, which are products, thus, letâ€™s not skip the multiplication part.

If you are reading this advent calendar, then you are already prepared to the fact that chained method calls are very handy for using in Perl 6 one-liners.

We also saw the colon-form of grep earlier in Day 2, but this time we are using a code block with a placeholder variable. It is not quite clear if you can use a star here, as we need the variable twice in the block.

The first part of the line uses the cross operator X*, weâ€™ll return to it in a few days here in this series. It generates products of all three-digit numbers. As we need the largest number, it makes sense to start from right to left, thatâ€™s why the sequence 999...100, but not 100...999.

Letâ€™s look at the first few numbers in the grepped sequence of products:

One-liners are not always very optimal. In our case, we need to generate the whole sequence of products to find the maximum among them. The answer resides at the third position, so it will be a mistake to replace max with first. But the good part is that if you use first, Perl 6 will not generate all the numbers. Thereâ€™s another useful method, head, which also prevents generating more than necessary.

The following code runs much faster and gives the correct result:

my solution

LikeLike