This week’s task has an interesting solution in Raku. So, here’s the task:

You are given two strings $A and $B. Write a script to check if the given strings are Isomorphic. Print 1 if they are otherwise 0.

Skip to content
# Category: Raku challenges

## Raku Challenge, Week 92, Issue 1

## Raku Challenge Week 91

Here’s my Raku breakfast with the solutions of Week 91 of The Weekly Challenge. A couple of simple programs with Raku arrays.

## Raku Challenge, Week 85

Welcome back to another week of the Weekly Challenge, and today I’ll briefly describe my solutions to the Week 85. Task 1. Triplet Sum. Task 2. Power of Two Integers.

## Raku Challenge Week 4, Task 1: Printing π

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.

## The weekly challenge 078: Leader element and 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.

## Programming with passion

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.

## Lonely X — The Weekly Challenge 77, Task 2

## Add up Fibonacci numbers — The Weekly Challenge 77, Task 1

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 more idiomatic Raku solution

## Largest Rectangle Histogram: The Raku Challenge Week 75, task 2

## Coins Sum: The Raku Challenge Week 75, task 1

## The weekly challenge nr 74

## Raku challenge week 73

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

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 71

## 🎥 Raku challenge review week 70

In this article, my review of the Raku solutions to the Weekly Challenge 70. The tasks are: 1) Character swapping, and 2) Generating Gray code. As a regular part of the review, there are two video covering all solutions that were sent by the participants.

## 🎥 Raku challenge review week 67

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.

## 🎥 Raku challenges: review of the first task of the first week

## 🎥 Raku challenges review 66-2

## 🎥 Raku challenges review 66-1

Science, Programming, Electronics, Languages

This week’s task has an interesting solution in Raku. So, here’s the task:

You are given two strings $A and $B. Write a script to check if the given strings are Isomorphic. Print 1 if they are otherwise 0.

This week’s task has an interesting solution in Raku. So, here’s the task:

You are given two strings $A and $B. Write a script to check if the given strings are Isomorphic. Print 1 if they are otherwise 0.

Here’s my Raku breakfast with the solutions of Week 91 of The Weekly Challenge. A couple of simple programs with Raku arrays.

Welcome back to another week of the Weekly Challenge, and today I’ll briefly describe my solutions to the Week 85. Task 1. Triplet Sum. Task 2. Power of Two Integers.

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

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.

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

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.

Solving the tasks of Week 71: Finding peak elements and Removing the item from a linked list.

Solving the tasks of Week 71: Finding peak elements and Removing the item from a linked list.

In this article, my review of the Raku solutions to the Weekly Challenge 70. The tasks are: 1) Character swapping, and 2) Generating Gray code. As a regular part of the review, there are two video covering all solutions that were sent by the participants.

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.