Science, Programming, Electronics, Languages
In this issue, we’ll take a look at an interesting pattern of passing multiple arguments to a function and apply it to creating a recursive sum.
In this issue, we’ll take a look at an interesting pattern of passing multiple arguments to a function and apply it to creating a recursive sum.
In this issue we’ll briefly talk about practical cases where junctions are really handy — both in syntax and in making the program simpler. Examples of using all and any junctions, checking parameters of MAIN, using in subsets.
In this issue we’ll briefly talk about practical cases where junctions are really handy — both in syntax and in making the program simpler. Examples of using all and any junctions, checking parameters of MAIN, using in subsets.
In this issue, we’ll talk about the built-in wrap routine and its possible applications: wrapping a function, measuring execution time, and logging.
In this issue, we’ll talk about the built-in wrap routine and its possible applications: wrapping a function, measuring execution time, and logging.
In this issue, we’ll discuss three elements in the Raku programming language that have the -rw suffix: substr-rw, return-rw, and take-rw.
In this issue, we’ll discuss three elements in the Raku programming language that have the -rw suffix: substr-rw, return-rw, and take-rw.
Let me return to the old challenges from last year and fill a few more gaps. The task for now is to write a program to output the same number of π digits as the size of the program.
Let me return to the old challenges from last year and fill a few more gaps. The task for now is to write a program to output the same number of π digits as the size of the program.
This week, The Weekly Challenge offered us a couple of simple tasks, so why not solve it on Monday. Task1: Leader Element. Task 2: Left Rotation.
This week, The Weekly Challenge offered us a couple of simple tasks, so why not solve it on Monday. Task1: Leader Element. Task 2: Left Rotation.
This week, I wrote a few programs solving the task of this week’s Weekly Challenge. I already explained the solution in the Raku programming language. In this post, I’d like to demonstrate other solutions. The key point is that they not only use different programming language but also approach the problem differently and implement different algorithms.
This week, I wrote a few programs solving the task of this week’s Weekly Challenge. I already explained the solution in the Raku programming language. In this post, I’d like to demonstrate other solutions. The key point is that they not only use different programming language but also approach the problem differently and implement different algorithms.
The second task of this week’s challenge sounds like this:
You are given m x n character matrix consists of O and X only. Write a script to count the total number of X surrounded by O only. Print 0 if none found.
The second task of this week’s challenge sounds like this:
You are given m x n character matrix consists of O and X only. Write a script to count the total number of X surrounded by O only. Print 0 if none found.
The task today is: You are given a positive integer $N. Write a script to find out all possible combination of Fibonacci Numbers required to get $N on addition. You are NOT allowed to repeat a number. Print 0 if none found.
The task today is: You are given a positive integer $N. Write a script to find out all possible combination of Fibonacci Numbers required to get $N on addition. You are NOT allowed to repeat a number. Print 0 if none found.
A couple of days ago I published a straightforward solution to the Task 2 of Week 75 of The Weekly Challenge. Despite that solution perfectly works, I wasn’t satisfied with it and wanted a more Raku-ish code. Here is the next iteration of it. my @hist = 3, 2, 3, 5, 7, 5; my $max … Continue reading “A more idiomatic Raku solution”
Hello, here is my solution to the Task 2 of Week 75 of the Weekly Challenge solved in the Raku programming language.
You are given an array of positive numbers @A. Write a script to find the largest rectangle histogram created by the given array.
Hello, here is my solution to the Task 2 of Week 75 of the Weekly Challenge solved in the Raku programming language.
You are given an array of positive numbers @A. Write a script to find the largest rectangle histogram created by the given array.
Here is my solution to the Task 1 of the Week 75 of the Weekly Challenge solved in the Raku programming language.
You are given a set of coins @C, assuming you have infinite amount of each coin in the set. Write a script to find how many ways you make sum $S using the coins from the set @C.
Here is my solution to the Task 1 of the Week 75 of the Weekly Challenge solved in the Raku programming language.
You are given a set of coins @C, assuming you have infinite amount of each coin in the set. Write a script to find how many ways you make sum $S using the coins from the set @C.
In this issue of the series, we are talking about two topics. The first is how to toss a coin using Raku. The second is how to avoid duplicated computations by setting the topic.
In this issue of the series, we are talking about two topics. The first is how to toss a coin using Raku. The second is how to avoid duplicated computations by setting the topic.
In this issue, we’ll be focusing on the built-in min function. Occasionally also on max, but the whole story is well applicable to both of them. Some of the elements can also be used with other functions.
In this issue, we’ll be focusing on the built-in min function. Occasionally also on max, but the whole story is well applicable to both of them. Some of the elements can also be used with other functions.
Welcome to the next issue of the series about the cool practical stuff in the Raku programming language. Today, we will discuss the usage of the so-called triangular reduction metaoperator on the following examples: [\*] and [\,].
Welcome to the next issue of the series about the cool practical stuff in the Raku programming language. Today, we will discuss the usage of the so-called triangular reduction metaoperator on the following examples: [\*] and [\,].
The Perl Weekly Challenge was renamed to The Weekly Challenge recently, so there’s a bigger chance that more solutions in other programming languages appear there.
In the two Raku solutions in this post, you can see how you can use the built-in Bag data type.
Task 1. Majority Element (Raku and C++ solutions). Task 2. First Non-Repeating Character (Raku solution).
The Perl Weekly Challenge was renamed to The Weekly Challenge recently, so there’s a bigger chance that more solutions in other programming languages appear there.
In the two Raku solutions in this post, you can see how you can use the built-in Bag data type.
Task 1. Majority Element (Raku and C++ solutions). Task 2. First Non-Repeating Character (Raku solution).
Another set of tiny but useful practical things that can help your coding practice in the Raku programming language. In this issue, we are talking about the MAIN function and the BEGIN phaser.
Another set of tiny but useful practical things that can help your coding practice in the Raku programming language. In this issue, we are talking about the MAIN function and the BEGIN phaser.
In this issue, I will be looking at the three use cases with the where clause. All the examples refer to the MAIN function, but the content is applicable to any other function.
In this issue, I will be looking at the three use cases with the where clause. All the examples refer to the MAIN function, but the content is applicable to any other function.
Here are my solutions to the tasks of Week 73 of the Perl Weekly Challenge: 1) Min Sliding Window and 2) Smallest Neighbour.
Here are my solutions to the tasks of Week 73 of the Perl Weekly Challenge: 1) Min Sliding Window and 2) Smallest Neighbour.
Raku challenge, week 72. Task 1: count trailing zeroes in a factorial of an integer. Task 2: Get lines A to B from a text file.
Raku challenge, week 72. Task 1: count trailing zeroes in a factorial of an integer. Task 2: Get lines A to B from a text file.