The Weekly Challenge - 326

Monday, Jun 16, 2025| Tags: Perl, Raku

TABLE OF CONTENTS


  1. HEADLINES

  2. SPONSOR

  3. RECAP

  4. PERL REVIEW

  5. RAKU REVIEW

  6. CHART

  7. NEW MEMBERS

  8. GUESTS

  9. TASK #1: Day of the Year

10. TASK #2: Decompressed List


HEADLINES


Welcome to the Week #326 of The Weekly Challenge.

Thank you, HVukman, for introducing a new programming language, PicoLisp. and sharing solution to Task #2.

Thank you, Team PWC, for your support and contributions. We have reached the peak, 99, twice this year. Having said, we are still looking for first breakthrough.

Contributions in guest languages have been consistent except in the Week #324 when it dipped very low. Having said, we made good progress in the Week #325,

Keep sharing knowledge every week.

Happy Hacking!!


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

  Week      Perl       Raku       Blog   
   321       46       26       27   
   322       44       24       25   
   323       46       22       26   
   324       50       24       17   
   325       46       24       29   

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

  Week      Guests       Contributions       Languages   
   321       13       61       23   
   322       13       56       19   
   323       12       60       21   
   324       12       38       15   
   325       12       59       21   

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     (3424)
 2. Rust       (922)
 3. Ruby       (803)
 4. Haskell    (783)
 5. Lua        (728)
 6. C++        (623)
 7. C          (590)
 8. JavaScript (566)
 9. Go         (497)
10. BQN        (442)

Blogs with Creative Title


1. Consecutive Search for Discount Prices by Adam Russell.

2. One Final by Arne Sommer.

3. Consecutive Discounts by Jorg Sommrey.

4. filter and iterate by Luca Ferrari.

5. Consecutive, but Maybe Not Final by Matthias Muth.

5. The Final Count One! by Packy Anderson.

6. Counts and discounts by Peter Campbell Smith.

7. Finality of the One Consecutive Price by Roger Bell_West.

8. Counting the discounts by Simon Green.


GitHub Repository Stats


1. Commits: 43,931 (+98)

2. Pull Requests: 12,170 (+38)

3. Contributors: 260

4. Fork: 328 (+1)

5. Stars: 191



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 - 325 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 #325.

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


Task 1: Day of the Year

Submitted by: Mohammad Sajid Anwar

You are given a date in the format YYYY-MM-DD.

Write a script to find day number of the year that the given date represent.


Example 1

Input: $date = '2025-02-02'
Output: 33

The 2nd Feb, 2025 is the 33rd day of the year.

Example 2

Input: $date = '2025-04-10'
Output: 100

Example 3

Input: $date = '2025-09-07'
Output: 250

Task 2: Decompressed List

Submitted by: Mohammad Sajid Anwar

You are given an array of positive integers having even elements.

Write a script to to return the decompress list. To decompress, pick adjacent pair (i, j) and replace it with j, i times.


Example 1

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

Pair 1: (1, 3) => 3 one time  => (3)
Pair 2: (2, 4) => 4 two times => (4, 4)

Example 2

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

Pair 1: (1, 1) => 1 one time  => (1)
Pair 2: (2, 2) => 2 two times => (2, 2)

Example 3

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

Pair 1: (3, 1) => 1 three times => (1, 1, 1)
Pair 2: (3, 2) => 2 three times => (2, 2, 2)


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


SO WHAT DO YOU THINK ?

If you have any suggestions or ideas then please do share with us.

Contact with me