Science, Programming, Electronics, Languages
The Pearls of Raku for your pleasure! The “with” statement, and setting a topic when working with regexes. Also a video with a full review of the Raku solutions 069-2.
The Pearls of Raku for your pleasure! The “with” statement, and setting a topic when working with regexes. Also a video with a full review of the Raku solutions 069-2.
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.
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.
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.
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.
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.
Here’s is an update to my previous solutions that uses sequences in Raku.
Here’s is an update to my previous solutions that uses sequences in Raku.
In this post, I am writing the solution for the second task in this week’s challenge in both Raku and C++.
In this post, I am writing the solution for the second task in this week’s challenge in both Raku and C++.
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 task is to find all so-called strobogrammatic numbers, which are the numbers that look the same if you rotate them upside down.
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.
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.
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.
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.
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.
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.
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.
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.
How to compute the value of the mathematical constant e using recursion in the Raku programming language.
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.
Print all Niven number up to 50, which are the numbers which are divisible the the sum of their digits.