Perl Weekly newsletter

German Perl/Raku Workshop 2027

2026-08-31T10:00:39Z

April 14-16, 2027

YAPC::Tokyo 2026

2026-08-31T10:00:38Z

November 27, 2026

London Perl & Raku Workshop 2026

2026-08-31T10:00:37Z

November 21, 2026

Punk: Perl MVC, compiled at boot

2026-08-31T10:00:36Z

November 16, 2026

MCP - Model Context Protocol in Perl: From Web App to AI Tools - with Dave Cross

2026-08-31T10:00:35Z

October 21, 2026

Amsterdam PM bijeenkomst

2026-08-31T10:00:34Z

October 06, 2026

Purdue Perl Mongers (HackLafayette) - TBA

2026-08-31T10:00:33Z

September 9, 2026

Async, Type-Safe, and Secure: Perl's Answer to FastAPI with Mohammad Sajid Anwar

2026-08-31T10:00:32Z

September 7, 2026

Amsterdam PM bijeenkomst

2026-08-31T10:00:31Z

September 01, 2026

NICEPERL's lists

2026-08-31T10:00:30Z

Great CPAN modules released last week;
MetaCPAN weekly report.

2026.34 YAR by Coke

2026-08-31T10:00:29Z

Secret Words

2026-08-31T10:00:28Z

Simon presents a clear, easily understandable answer to Challenge 388 by utilising a combination of language-specific primitives and an explicit algorithmic solution. His method of counting word frequencies with hash mappings also maintains an intuitive set intersection process, making it quick and effective to implement in Perl and Python.

Secret Dyck

2026-08-31T10:00:27Z

Roger takes an elegant multilingual approach to the Weekly Challenge 388, combining pragmatic graph traversal techniques with clear math. For Task 1, he utilises a breadth-first search (BFS) queue that eliminates invalid Dyck word branches early, while he uses techniques from pattern matching in languages such as Scala and Typst to calculate derangements through the OEIS A000166 recurrence relation.

The Weekly Challenge #388

2026-08-31T10:00:26Z

The blog by Robbie showcases the efficacious use of the integer binary encoding method for the purpose of generating Dyck words as well as CPAN modules. The article describes how nicely he thought of generating candidate numbers in binary form as that enabled him to produce Dyck words in order without having to perform additional sorting.

Up and down the chimney

2026-08-31T10:00:25Z

The article by Peter provides a clear and practical explanation of the process of generating Dyck words using depth-first recursive backtracking techniques. He explains how effective he was in switching from an ineffective brute force method to a selective tree-search algorithm that monitors the number of symbols on an ongoing basis.

Code of Many Colors

2026-08-31T10:00:24Z

Packy’s article presents an interesting and insightful analysis of the Dyck word generation problem and Secret Santa derangement in Perl, Raku, Python, and Elixir. The value of the article lies in his straightforward approach in Task 1, where he shows the use of inductive structural decomposition (splitting and enveloping sub-words) in the process of generating correct Dyck word sequences and at the same time avoiding faulty paths in all programming languages used.

Dyck Santa

2026-08-31T10:00:23Z

Matthias gives a neat and clear account of both algorithmic tasks in providing the sounding mathematical context. In the case of the first approach, he makes use of constrained recursive state tracking for the generation of Dyck words which lets him get rid of invalid paths at the early stage. Having thus approached the above task, he does not stop there and goes further using the recursive/DP method of solving the problem with derangements which excludes the time-consuming permutations generation.

Perl Weekly Challenge 388

2026-08-31T10:00:22Z

W. Luis Mochan's post features a clear and concise Perl implementation for Challenge 388. He utilizes idiomatic Perl techniques while employing functional pipelines such as grep and map, in addition to recursion, in order to efficiently tackle both Dyck words and derangements.

Secret Words

2026-08-31T10:00:21Z

In this interesting article, Jorg provides a thorough math-heavy analysis of Perl Weekly Challenge #388. The post contains a great dose of engineering thinking since it shows how to reach an 8-times speedup through optimising the code, what is the Dyck prefix generation benchmarking, and also cleverly applying the floor formula for computing the Secret Santa derangements in Perl and J.

Perl Weekly Challenge: Week 388

2026-08-31T10:00:20Z

The blog by Jaldhar provides a detailed rundown of the execution of both of the exercises in Raku and Perl. He shows how one can apply recursive depth-first search approach to generate Dyck words and how to utilise the advanced features of Raku language—like .permutations(), the Z== zip operator, and junctions—to succinctly write declarative array-matching code in the Secret Santa derangements case.

I Refuse to Indulge in the Obvious Jokes

2026-08-31T10:00:19Z

Bob's article showcases an elegant and effective way of solving the Dyck Words problem recursively in the Perl programming language. By keeping a careful watch on several parameters, such as depth, number of remaining characters, and prefixes used in the solution, the program generates correct sequences in a simple and efficient manner while maintaining clear code.

Secret Dyck

2026-08-31T10:00:18Z

In this blog post, Arne provides an excellent description of various complicated concepts like replacement of recursion by using a queue state-machine in the case of Dyck words, as well as offers detailed explanations of the code with thorough testing output.

TWC388

2026-08-31T10:00:17Z

The blog by Ali presents straightforward and practical approaches to both assignments. For example, to solve Dyck Words, it builds a stack state machine to avoid overhead while traveling through the recursion of the algorithm. A memoized recursion is also used for generating cleanly the results for the Secret Santa derangements without producing huge permutations.

RECAP - The Weekly Challenge - 388

2026-08-31T10:00:16Z

Enjoy a quick recap of last week's contributions by Team PWC dealing with the "Dyck Words" and "Secret Santa" tasks in Perl and Raku. You will find plenty of solutions to keep you busy.

The Weekly Challenge - 389

2026-08-31T10:00:15Z

Welcome to a new week with a couple of fun tasks "Reorder Notes" and "ZigZag Subarray". If you are new to the weekly challenge then why not join us and have fun every week. For more information, please read the FAQ.

PAGI::FastAPI v1.7.0

2026-08-31T10:00:14Z

This post is all about the latest features added to v1.7.0. Of all, you can now expose per-route OpenAPI Metadata.

Bloom Filter

2026-08-31T10:00:13Z

My attempt to explore Bloom filter. In this post, I share my experiment.

Webhook using PAGI::FastAPI

2026-08-31T10:00:12Z

One of my favourite features, Webhook. You cam work with Webhook using PAGI::FastAPI.

Message Queue using PAGI::FastAPI

2026-08-31T10:00:11Z

This post helps you create message queue facade, a very simple easy to follow demo application using PAGI::FastAPI.

API Gateway using PAGI::FastAPI

2026-08-31T10:00:10Z

Part of short post series on PAGI::FastAPI, this post talk about how we can create and use API Gateway with the help of PAGI::FastAPI.

pperl: Doing a REJIT

2026-08-31T10:00:09Z

Introducing ReJIT, a secondary compiler designed to bridge the performance gap with V8’s Irregexp on regex-intensive benchmarks like regex-redux.

CPerl mode for Emacs is now on GNU ELPA

2026-08-31T10:00:08Z

For all emacs users, CPerl is now available on register if you are planning to attend the event. This will help the LPW Organisers to better plan the event. If this is your first time attending LPW then I would encourage you to submit as well. There is another exciting announcement, YAPC::Tokyo 2026 is hapenning between 27th - 29th November 2026. There is a surprise, Larry Wall, is one of the speakers listed by the organisers. I wish he would join us, LPW, too.

Talking about events, there is one more planned for next Monday, 7th September 2026. It is an online event organised by Gabor Szabo. There is still time to register if you are available. I will be presenting the talk, Async, Type-Safe, and Secure: Perl's Answer to FastAPI. It is about my latest CPAN module, PAGI::FastAPI. Both PAGI and FastAPI is new to me. PAGI::FastAPI helped me explore both. Thanks John Napiorkowski for the guidance and support. I wrote a blog post yesterday where I shared the latest update of PAGI::FastAPI v1.7.0.

As the LPW 2026 is announced, I am back to finish the manuscript for my upcoming book on DBIx::Class. I hope to have it ready to launch at the LPW 2026. Please wish me luck.

Enjoy rest of the newsletter.