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.

Skip to content
# Andrew Shitov

## Finding stepping numbers in Raku

## 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.

## Find the shortest unique prefix

This is a solution of the Task 2 from Week 57 of the Perl Weekly Challenge. Find the shortest unique prefixes for the given list of words.

## 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.

## Division by zero in Raku

## Raku challenge Week 30

Task 1: List all Christmas days which fall on Sunday in 2019–2100. Task 2: Find all combinations of three numbers, which give 12 in total.

## Raku challenge Week 26

## 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.

## Computing e in Raku

How to compute the value of the mathematical constant e using recursion in the Raku programming language.

## Cached factorial in Raku

Factorial, being a classical task for practising algorithms, is a great example to demonstrate the features of Raku. Let us update the code so that it caches the already calculated values.

## Implementing priority queue in Raku

## Implementing the Ackermann function in Raku

## Generating Niven numbers in Raku

Print all Niven number up to 50, which are the numbers which are divisible the the sum of their digits.

## Raku challenge Week 3

## Raku challenges Week 2

## Raku Challenge Week 1

## Combinations in Raku

Monday morning, and there are new tasks in the new weekly challenge 067. Both of them require similar Raku tools, namely, the cross operator X.

## Collatz Conjecture in Raku

An interesting task offered on Week 54 of the Perl Weekly Challenge: Print the Collatz Conjecture for the given integer number. The conjecture is that for any starting number, the sequence ends with 1.

## More Raku challenges

Task 1: Find the first 20 so-called Gapful numbers. Task 2: Print all palindromic ddmmyyyy dates between 2000 and 3000. Task 3: Find the first multiple of the given number, which only contains digits 0 and 1.

## Programming challenge: insert signs between digits

Here’s another drill offered by the Perl Weekly Challenge on Week 44. The task is to get a string 123456789 and insert the signs + and – between the digits so that the evaluated value of the new string equals 100.

Science, Programming, Electronics, Languages

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.

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.

This is a solution of the Task 2 from Week 57 of the Perl Weekly Challenge. Find the shortest unique prefixes for the given list of words.

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 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.

Task 1: List all Christmas days which fall on Sunday in 2019–2100. Task 2: Find all combinations of three numbers, which give 12 in total.

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.

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.

How to compute the value of the mathematical constant e using recursion in the Raku programming language.

Factorial, being a classical task for practising algorithms, is a great example to demonstrate the features of Raku. Let us update the code so that it caches the already calculated values.

Let us implement a simple priority queue in the Raku programming language.

Let us implement a simple priority queue in the Raku programming language.

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.

Print all Niven number up to 50, which are the numbers which are divisible the the sum of their digits.

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.

Task 1. Remove leading zeros from positive numbers.

Task 2. Convert a number to the one represented as a base-35 number and back.

Task 1. Remove leading zeros from positive numbers.

Task 2. Convert a number to the one represented as a base-35 number and back.

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.

Monday morning, and there are new tasks in the new weekly challenge 067. Both of them require similar Raku tools, namely, the cross operator X.

An interesting task offered on Week 54 of the Perl Weekly Challenge: Print the Collatz Conjecture for the given integer number. The conjecture is that for any starting number, the sequence ends with 1.

Task 1: Find the first 20 so-called Gapful numbers. Task 2: Print all palindromic ddmmyyyy dates between 2000 and 3000. Task 3: Find the first multiple of the given number, which only contains digits 0 and 1.

Here’s another drill offered by the Perl Weekly Challenge on Week 44. The task is to get a string 123456789 and insert the signs + and – between the digits so that the evaluated value of the new string equals 100.