The Weekly Challenge

HEADLINES

Welcome to the Week #327 of The Weekly Challenge.

Finally the wait is over, we have back to back weeks reaching the magical number of 100+ contributions.

Week #325 became the first week of the year 2025 to reach the target with some late contributions.

Week #326 immediately became the most popular week of the year 2025 beating the Week #325.

With regard to the guest contributions, Week #326, is the best week of the year 2025.

Well done, Team PWC, for your support and encouragements.

Last week, we received surprise contributions by one of the earliest member, Simon Proctor.

Welcome back, Simon and thanks for your contributions in Raku and blog post. I hope you are doing great. We all missed you.

Welcome back, mauke, another very old member of Team PWC. Thanks for the contributions in Perl.

I would like to thank, BarOff, for last minute contributions to Week #325. It helped us reach the magical figure.

I noticed some members sharing solutions on various social platform. I loved it. It feels great to see member sharing views on each others code.

Last but not least, thank you to all who keep sending kind words every week. Although I don’t get to reply each, please do remember, your words are priceless.

Happy Hacking!!

Last 5 weeks mainstream contribution stats. Thank you Team PWC for your support and encouragements.


`Week`	`Perl`	`Raku`	`Blog`
`322`	44	24	25
`323`	46	22	26
`324`	50	24	17
`325`	46	25	29
`326`	48	27	28

Last 5 weeks guest contribution stats. Thank you each and every guest contributors for your time and efforts.


`Week`	`Guests`	`Contributions`	`Languages`
`322`	13	56	19
`323`	12	60	21
`324`	12	38	15
`325`	12	59	21
`326`	13	64	23

TOP 10 Guest Languages

Do you see your favourite language in the Top #10? If not then why not contribute regularly and make it to the top.

 1. Python     (3438)
 2. Rust       (926)
 3. Ruby       (805)
 4. Haskell    (785)
 5. Lua        (730)
 6. C++        (625)
 7. C          (592)
 8. JavaScript (568)
 9. Go         (501)
10. BQN        (442)

Blogs with Creative Title

1. The Day We Decompress by Adam Russell.

2. Decompressed Day by Arne Sommer.

3. The Length of a Day by Jorg Sommrey.

4. Happy Birthday Ma’! by Luca Ferrari.

5. Modern Perl’s Victory by Matthias Muth.

6. Got a date with compression! by Packy Anderson.

7. Days to decompress by Peter Campbell Smith.

8. Day of the Decompression by Roger Bell_West.

GitHub Repository Stats

1. Commits: 44,039 (`+108`)

2. Pull Requests: 12,206 (`+36`)

3. Contributors: 260

4. Fork: 328

5. Stars: 192 (`+1`)

With start of Week #268, we have a new sponsor Lance Wicks until the end of year 2025. Having said we are looking for more sponsors so that we can go back to weekly winner. If anyone interested please get in touch with us at perlweeklychallenge@yahoo.com. Thanks for your support in advance.

RECAP

Quick recap of The Weekly Challenge - 326 by Mohammad Sajid Anwar.

PERL REVIEW

If you missed any past reviews then please check out the collection.

RAKU REVIEW

If you missed any past reviews then please check out the collection.

CHART

Please take a look at the charts showing interesting data.

I would like to THANK every member of the team for their valuable suggestions. Please do share your experience with us.

NEW MEMBERS

Please find out How to contribute?, if you have any doubts.

Please try the excellent tool EZPWC created by respected member Saif Ahmed of Team PWC.

GUESTS

Please check out the guest contributions for the Week #326.

Please find past solutions by respected guests. Please share your creative solutions in other languages.

Task 1: Missing Integers

Submitted by: Mohammad Sajid Anwar

You are given an array of n integers.

Write a script to find all the missing integers in the range 1..n in the given array.

Example 1

Input: @ints = (1, 2, 1, 3, 2, 5)
Output: (4, 6)

The given array has 6 elements.
So we are looking for integers in the range 1..6 in the given array.
The missing integers: (4, 6)

Example 2

Input: @ints = (1, 1, 1)
Output: (2, 3)

Example 3

Input: @ints = (2, 2, 1)
Output: (3)

Task 2: MAD

Submitted by: Mohammad Sajid Anwar

You are given an array of distinct integers.

Write a script to find all pairs of elements with minimum absolute difference (MAD) of any two elements.

Example 1

Input: @ints = (4, 1, 2, 3)
Output: [1,2], [2,3], [3,4]

The minimum absolute difference is 1.
Pairs with MAD: [1,2], [2,3], [3,4]

Example 2

Input: @ints = (1, 3, 7, 11, 15)
Output: [1,3]

Example 3

Input: @ints = (1, 5, 3, 8)
Output: [1,3], [3,5]

Last date to submit the solution 23:59 (UK Time) Sunday 29th June 2025.