Science, Programming, Electronics, Languages
My review of the solutions in the Raku programming language of the tasks from Week 67 of the Weekly Challenge. The task 1 is to generate numeric combinations. The task 2 is to work with the letters on a phone keypad.
My review of the solutions in the Raku programming language of the tasks from Week 67 of the Weekly Challenge. The task 1 is to generate numeric combinations. The task 2 is to work with the letters on a phone keypad.
How do tr, TR string replacements work in Raku. What is a StrDistance type? What happens when you print such objects with ‘put’ and ‘say’?
How do tr, TR string replacements work in Raku. What is a StrDistance type? What happens when you print such objects with ‘put’ and ‘say’?
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.
On this page, you can find the links from where you can buy my books in the electronic or paper forms.
On this page, you can find the links from where you can buy my books in the electronic or paper forms.
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.
I have published my new book, ‘A Tour of Python 3’. The book is available on LeanPub in PDF and EPUB and on Amazon for Kindle.
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.
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.
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.