Raku – Page 4 – Andrew Shitov

🎥 The Pearls of Raku, Issue 1

Let me demonstrate a few interesting things that I found by looking at the Raku solutions of last week’s Perl Weekly Challenge 1. All of them are notable as they reflect how differently people think, how unexpectedly they approach the same problems, and how big Raku is. So big that you forget or never meet some of its corners. In this issue: method operatos, $*USAGE, and :skip-empty.

Raku challenge Week 70, issue 1

Here is a program in Raku to solve the task 1 of the weekly challenge. An interesting thing here is a reminder of how you swap the two elements of an array.

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.

Use sequences in Raku

Here’s is an update to my previous solutions that uses sequences in Raku.

Raku challenge Week 69, issue 2

In this post, I am writing the solution for the second task in this week’s challenge in both Raku and C++.

Raku challenge Week 69, issue 1

The task is to find all so-called strobogrammatic numbers, which are the numbers that look the same if you rotate them upside down.

The Lost Record: Larry Wall’s Perl 6 (Raku) announcement back in 2015 at FOSDEM

In February 2015, Larry Wall gave a keynote talk at the annual FOSDEM conference in Brussels. That was a talk of historical importance. And that was a talk, whose recording was never published. Fortunately, I have an audio recoding, which I am publishing now on YouTube. This seems to be the only existing recoding today.

Raku Challenge Week 68

You are given a matrix of size M x N having only 0s and 1s. Write a script to set the entire row and column to 0 if an element is 0.

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.

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

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

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.

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

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

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.