TABLE OF CONTENTS
01. HEADLINES
02. SPONSOR
03. RECAP
04. PERL REVIEW
05. RAKU REVIEW
06. CHART
07. NEW MEMBERS
08. GUESTS
09. TASK #1: Shortest Time
10. TASK #2: Array Pairings
HEADLINES
Welcome to the Week #206
of The Weekly Challenge
.
We have one more addition to the Team PWC
, an experience Perl
hacker by the name Avery Adams. Thanks for sharing solutions in Perl.
E. Alvarez
is back to blogging again and we have another gem from him. Thank you.
I would like to thank Team PWC
members for the kind messages and asking about me. It means a lot. Please forgive me if you don’t hear from me. Every word of yours means a world to me. It would be unfair if I take names here but you know who I am talking about.
If you see delay from my side then please accept my apology as I am trying my best to deal with the situation to the best of my ability. I can’t talk more in public but if you are keen then we can have one-2-one through email.
Today, we are giving away Coupon #29
to Lubos Kolouch
for the book, Learning Perl Exercises by brian d foy
. I will share the details with you in a separate email.
PAST WINNERS
S. No. |
Name |
S. No. |
Name |
1. | Cheok-Yin Fung |
2. | W. Luis Mochan |
3. | Robert DiCicco |
4. | Kueppo Wesley |
5. | Solathian |
6. | Dario Mazzeo |
7. | Peter Campbell Smith |
8. | Kjetil Skotheim |
9. | Neils van Dijke |
10. | Laurent Rosenfeld |
11. | Duncan C. White |
12. | Ali Moradi |
13. | Jorg Sommrey |
14. | James Smith |
15. | Alexander Pankoff |
16. | Simon Green |
17. | Robbie Hatley |
18. | Bob Lied |
19. | Athanasius |
20. | David Ferrone |
21. | Thomas Kohler |
22. | Adam Russell |
23. | E. Choroba |
24. | Pip Stuart |
25. | Roger Bell_West |
26. | Flavio Poletti |
27. | Dave Jacoby |
28. | Mariano Spadaccini |
29. | 30. | ||
31. | 32. | ||
33. | 34. | ||
35. | 36. | ||
37. | 38. | ||
39. | 40. | ||
41. | 42. | ||
43. | 44. | ||
45. | 46. | ||
47. | 48. | ||
49. | 50. | ||
I am overwhelmed by the contributions in Perl
last week. Even Raku
was nearly half of Perl
. With regard to the blog, we have regular bloggers who keep us busy all week. I would like to take this opportunity to than each and every members of Team PWC
. The discussion is getting intensed as we grow. I really enjoy the company of such a cool bunch of techies.
Sometimes, one week is not enough to go through each contributions. I have noticed the quality of blogs have improved too. Kudos to the team once again.
Week |
Perl |
Raku |
Blog |
184 |
57 | 31 | 17 |
185 |
61 | 35 | 19 |
186 |
58 | 33 | 20 |
187 |
51 | 34 | 20 |
188 |
63 | 36 | 16 |
189 |
62 | 35 | 18 |
190 |
55 | 32 | 23 |
191 |
56 | 38 | 21 |
192 |
59 | 41 | 23 |
193 |
55 | 31 | 22 |
194 |
58 | 32 | 19 |
195 |
58 | 29 | 19 |
196 |
51 | 29 | 20 |
197 |
49 | 31 | 20 |
198 |
54 | 37 | 23 |
199 |
52 | 32 | 22 |
200 |
55 | 33 | 23 |
201 |
55 | 29 | 22 |
202 |
50 | 27 | 24 |
203 |
52 | 24 | 18 |
204 |
54 | 31 | 22 |
205 |
64 | 30 | 25 |
I would like to thank every guest contributors for making it special every week. Last week we received 61 guest contributions
in 20 languages
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 (1334)
2. Haskell (535)
3. Ruby (466)
4. Lua (448)
5. C (326)
6. C++ (322)
7. Rust (319)
8. BQN (268)
9. Go (244)
10. Java (218)
Blogs with Creative Title
1. The Highest Maximum by Arne Sommer.
2. Exclusive Third Or First by Bruce Gray.
3. Reset Content by Dave Jacoby.
4. nested loops in a rush! by Luca Ferrari.
5. Third Exclusive by Roger Bell_West.
GitHub Repository Stats
1. Commits: 30,900 (+128
)
2. Pull Requests: 7,631 (+41
)
3. Contributors: 219 (+1
)
4. Fork: 276
5. Stars: 151
SPONSOR
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 - 205 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
Avery Adams, an experienced Perl
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 #204.
Please find past solutions by respected guests. Please share your creative solutions in other languages.
Task 1: Shortest Time
Submitted by: Mohammad S Anwar
You are given a list of time points, at least 2, in the 24-hour clock format HH:MM
.
Write a script to find out the shortest time in minutes between any two time points.
Example 1
Input: @time = ("00:00", "23:55", "20:00")
Output: 5
Since the difference between "00:00" and "23:55" is the shortest (5 minutes).
Example 2
Input: @array = ("01:01", "00:50", "00:57")
Output: 4
Example 3
Input: @array = ("10:10", "09:30", "09:00", "09:55")
Output: 15
Task 2: Array Pairings
Submitted by: Mohammad S Anwar
You are given an array of integers having even number of elements..
Write a script to find the maximum sum of the minimum of each pairs.
Example 1
Input: @array = (1,2,3,4)
Output: 4
Possible Pairings are as below:
a) (1,2) and (3,4). So min(1,2) + min(3,4) => 1 + 3 => 4
b) (1,3) and (2,4). So min(1,3) + min(2,4) => 1 + 2 => 3
c) (1,4) and (2,3). So min(1,4) + min(2,3) => 2 + 1 => 3
So the maxium sum is 4.
Example 2
Input: @array = (0,2,1,3)
Output: 2
Possible Pairings are as below:
a) (0,2) and (1,3). So min(0,2) + min(1,3) => 0 + 1 => 1
b) (0,1) and (2,3). So min(0,1) + min(2,3) => 0 + 2 => 2
c) (0,3) and (2,1). So min(0,3) + min(2,1) => 0 + 1 => 1
So the maximum sum is 2.
Last date to submit the solution 23:59 (UK Time) Sunday 5th March 2023.