The Weekly Challenge

HEADLINES

Welcome to the Week #231 of The Weekly Challenge.

Let us all welcome new member, rcmlz, to the Team PWC.

This week challenge is the struggle work from place where I hardly had stable internet. Somehow I am managing it.

I can’t wait to get to back to my regular comfortable place i.e. London.

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


`Week`	`Perl`	`Raku`	`Blog`
`226`	59	32	25
`227`	53	30	26
`228`	58	28	24
`229`	57	30	24
`230`	62	32	25

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


`Week`	`Guests`	`Contributions`	`Languages`
`226`	13	52	14
`227`	09	36	11
`228`	15	57	18
`229`	13	55	17
`230`	15	54	20

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     (1759)
 2. Haskell    (576)
 3. Ruby       (569)
 4. Lua        (506)
 5. C          (435)
 6. Rust       (416)
 7. C++        (398)
 8. BQN        (305)
 9. Go         (264)
10. JavaScript (247)

Blogs with Creative Title

1. Words and Digits by Arne Sommer.

2. Two One-Liners and Short Programs by Dave Jacoby.

3. On Perl’s Home Ground by Matthias Muth.

4. Not the Stated Problem by Packy Anderson.

5. The Count of Separation by Roger Bell_West.

GitHub Repository Stats

1. Commits: 33,847 (`+110`)

2. Pull Requests: 8,580 (`+42`)

3. Contributors: 227

4. Fork: 287 (`+1`)

5. Stars: 162

Our solo sponsor Pete Sergeant has been a great support to keep us motivated. We are lucky that he agreed to continue the journey with us in the year 2023. I would like to personally thank Pete and his entire team for their generosity. It would be great if we could add few more to sponsor the prize money so that we could go back and declare weekly champions as we have done in the past. I hope and wish this will become possible in 2023. The amount doesn’t have to be huge. However, it would be nice to show off bunch of supporters. If an organisation comes forward and supports us then that would be the ultimate achievement.

RECAP

Quick recap of The Weekly Challenge - 230 by Mohammad S 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

rcmlz, an expert Raku hacker joined the Team PWC.

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

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

Task 1: Min Max

Submitted by: Mohammad S Anwar

You are given an array of distinct integers.

Write a script to find all elements that is neither minimum nor maximum. Return -1 if you can’t.

Example 1

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

The minimum is 1 and maximum is 4 in the given array. So (3, 2) is neither min nor max.

Example 2

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

Example 3

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

The minimum is 1 and maximum is 3 in the given array. So 2 is neither min nor max.

Task 2: Senior Citizens

Submitted by: Mohammad S Anwar

You are given a list of passenger details in the form “9999999999A1122”, where 9 denotes the phone number, A the sex, 1 the age and 2 the seat number.

Write a script to return the count of all senior citizens (age >= 60).

Example 1

Input: @list = ("7868190130M7522","5303914400F9211","9273338290F4010")
Ouput: 2

The age of the passengers in the given list are 75, 92 and 40.
So we have only 2 senior citizens.

Example 2

Input: @list = ("1313579440F2036","2921522980M5644")
Ouput: 0

Last date to submit the solution 23:59 (UK Time) Sunday 27th August 2023.