Gray code in Raku

Let us create a one-liner to generate the sequence of the so-called Gray code in the Raku programming language. This code is essentially a method of binary coding so that for each of the following integer number, you only change a single bit.

Let us create a one-liner to generate the sequence of the so-called Gray code in the Raku programming language. This code is essentially a method of binary coding so that for each of the following integer number, you only change a single bit.

Finding stepping numbers in Raku

Here is a possible solution of the Task 1 of Week 52 of the Perl Weekly Challenge in the Raku programming language.

Find all stepping numbers between 100 and 999. A number is called a stepping number if the adjacent digits have a difference of 1.

Here is a possible solution of the Task 1 of Week 52 of the Perl Weekly Challenge in the Raku programming language.

Find all stepping numbers between 100 and 999. A number is called a stepping number if the adjacent digits have a difference of 1.

Wave arrays, a solution in Raku

For the given array of integers, rearrange the items so that the shape of the resulting array resembles the wave, that is, the second item is less or equals than the first one, the third item is bigger or equals to the second, then again a smaller number, then a bigger, and so on.

For the given array of integers, rearrange the items so that the shape of the resulting array resembles the wave, that is, the second item is less or equals than the first one, the third item is bigger or equals to the second, then again a smaller number, then a bigger, and so on.

A few more Raku challenges

1) From the given digits L, combine all possible numbers that are less than Y and that contain exactly X digits. 2) Write a function that from the given string returns the last word that matches the given regex.

1) From the given digits L, combine all possible numbers that are less than Y and that contain exactly X digits. 2) Write a function that from the given string returns the last word that matches the given regex.

Division by zero in Raku

Division by zero in Raku is one of my favourite topics. Let me demonstrate a couple of approaches that can be used in solving Task 1 of the Perl Weekly Challenge 31.

The task is to write a function that checks the division by zero without explicitly comparing the denominator with zero.

Division by zero in Raku is one of my favourite topics. Let me demonstrate a couple of approaches that can be used in solving Task 1 of the Perl Weekly Challenge 31.

The task is to write a function that checks the division by zero without explicitly comparing the denominator with zero.

Raku challenge Week 26

Hello, let us solve the text-processing Task 1 from the Week 26 of the Perl Weekly Challenge. The task is: Take the two words and count all letters in the second word, which are present in the first word.

I have two solutions here, and I believe there is potential to make them shorter.

Hello, let us solve the text-processing Task 1 from the Week 26 of the Perl Weekly Challenge. The task is: Take the two words and count all letters in the second word, which are present in the first word.

I have two solutions here, and I believe there is potential to make them shorter.

Generating sexy prime pairs in Raku

This is article about programming. This solves Task 1 of the Perl Weekly Challenge 027. The so-called sexy prime pairs are pairs of prime numbers that differ by 6.

This is article about programming. This solves Task 1 of the Perl Weekly Challenge 027. The so-called sexy prime pairs are pairs of prime numbers that differ by 6.

Implementing the Ackermann function in Raku

This is the Task 1 from the Perl Weekly Challenge Week 17. You have to implement the so-called Ackermann function.

This is an interesting function that is defined kind of recursively but actually this is not a recursion, as the recurrent formula is using the function as an argument of itself.

This is the Task 1 from the Perl Weekly Challenge Week 17. You have to implement the so-called Ackermann function.

This is an interesting function that is defined kind of recursively but actually this is not a recursion, as the recurrent formula is using the function as an argument of itself.

Raku challenge Week 3

Task 1. Generate a list of Regular numbers, which are the numbers, whose prime factors do not exceed 5.

Task 2. Print Pascal triangle with the given number of rows.

Task 1. Generate a list of Regular numbers, which are the numbers, whose prime factors do not exceed 5.

Task 2. Print Pascal triangle with the given number of rows.

Raku Challenge Week 1

Task 1. Capitalise all small letters ‘e’ and count the number of replacements in the string ‘Perl Weekly Challenge.’

Task 2. Write a one-liner that, for the numbers from 1 to 20, prints ‘fizz’ if the number is divisible by 3 and ‘buzz’ if it is divisible by 5.

Task 1. Capitalise all small letters ‘e’ and count the number of replacements in the string ‘Perl Weekly Challenge.’

Task 2. Write a one-liner that, for the numbers from 1 to 20, prints ‘fizz’ if the number is divisible by 3 and ‘buzz’ if it is divisible by 5.