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: Bitwise OR
10. TASK #2: Distribute Elements
HEADLINES
Welcome to the Week #269
of The Weekly Challenge
.
One more language, Nu
, added to the guest lanuages, thanks to Asher Harvey-Smith
. You can find the solution to Task #1 and Task #2 in Nu
.
Talking about guest language, we have received solution to Task #1 and Task #2 in Crystal
, thanks to Roger Bell_West
.
I would like to apologise in delay last week as I am fighting with Hayfever
. I will try to catch up in the next few days.
Last 5 weeks
mainstream contribution stats. Thank you Team PWC
for your support and encouragements.
Week |
Perl |
Raku |
Blog |
264 |
50 | 34 | 26 |
265 |
54 | 32 | 26 |
266 |
55 | 29 | 24 |
267 |
50 | 27 | 24 |
268 |
48 | 31 | 26 |
Last 5 weeks
guest contribution stats. Thank you each and every guest contributors for your time and efforts.
Week |
Guests |
Contributions |
Languages |
264 |
14 | 66 | 20 |
265 |
12 | 52 | 16 |
266 |
12 | 53 | 16 |
267 |
14 | 58 | 20 |
268 |
15 | 75 | 26 |
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 (2496)
2. Ruby (680)
3. Haskell (664)
4. Rust (628)
5. Lua (600)
6. C (536)
7. C++ (506)
8. JavaScript (410)
9. Go (359)
10. BQN (334)
Blogs with Creative Title
1. Numerous Numbers by Arne Sommer.
2. Games Numbers Play by Bob Lied.
3. Sorting This and That by Jorg Sommrey.
4. arrays and slices by Luca Ferrari.
5. Perl Magic Games by Matthias Muth.
6. Let’s do the Numbers! by Packy Anderson.
7. Magic and scrambled numbers by Peter Campbell Smith.
8. If the Game is Magic, Where’s My Number? by Roger Bell_West.
9. The magical number game by Simon Green.
GitHub Repository Stats
1. Commits: 38,051 (+114
)
2. Pull Requests: 10,069 (+40
)
3. Contributors: 244
4. Fork: 308
5. Stars: 172 (+1
)
SPONSOR
With start of Week #268
, we have a new sponsor Lance Wicks
for the entire year 2024
. 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 - 268 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 #268.
Please find past solutions by respected guests. Please share your creative solutions in other languages.
Task 1: Bitwise OR
Submitted by: Mohammad Sajid Anwar
You are given an array of positive integers, @ints
.
Write a script to find out if it is possible to select two or more elements of the given array such that the bitwise OR of the selected elements has atlest one trailing zero in its binary representation.
Example 1
Input: @ints = (1, 2, 3, 4, 5)
Output: true
Say, we pick 2 and 4, thier bitwise OR is 6. The binary representation of 6 is 110.
Return true since we have one trailing zero.
Example 2
Input: @ints = (2, 3, 8, 16)
Output: true
Say, we pick 2 and 8, thier bitwise OR is 10. The binary representation of 10 is 1010.
Return true since we have one trailing zero.
Example 3
Input: @ints = (1, 2, 5, 7, 9)
Output: false
Task 2: Distribute Elements
Submitted by: Mohammad Sajid Anwar
You are given an array of distinct integers, @ints
.
Write a script to distribute the elements as described below:
1) Put the 1st element of the given array to a new array @arr1.
2) Put the 2nd element of the given array to a new array @arr2.
Once you have one element in each arrays, @arr1
and @arr2
, then follow the rule below:
If the last element of the array @arr1 is greater than the last
element of the array @arr2 then add the first element of the
given array to @arr1 otherwise to the array @arr2.
When done distribution, return the concatenated arrays. @arr1
and @arr2
.
Example 1
Input: @ints = (2, 1, 3, 4, 5)
Output: (2, 3, 4, 5, 1)
1st operation:
Add 1 to @arr1 = (2)
2nd operation:
Add 2 to @arr2 = (1)
3rd operation:
Now the last element of @arr1 is greater than the last element
of @arr2, add 3 to @arr1 = (2, 3).
4th operation:
Again the last element of @arr1 is greate than the last element
of @arr2, add 4 to @arr1 = (2, 3, 4)
5th operation:
Finally, the last element of @arr1 is again greater than the last
element of @arr2, add 5 to @arr1 = (2, 3, 4, 5)
Mow we have two arrays:
@arr1 = (2, 3, 4, 5)
@arr2 = (1)
Concatenate the two arrays and return the final array: (2, 3, 4, 5, 1).
Example 2
Input: @ints = (3, 2, 4)
Output: (3, 4, 2)
1st operation:
Add 1 to @arr1 = (3)
2nd operation:
Add 2 to @arr2 = (2)
3rd operation:
Now the last element of @arr1 is greater than the last element
of @arr2, add 4 to @arr1 = (3, 4).
Mow we have two arrays:
@arr1 = (3, 4)
@arr2 = (2)
Concatenate the two arrays and return the final array: (3, 4, 2).
Example 3
Input: @ints = (5, 4, 3 ,8)
Output: (5, 3, 4, 8)
1st operation:
Add 1 to @arr1 = (5)
2nd operation:
Add 2 to @arr2 = (4)
3rd operation:
Now the last element of @arr1 is greater than the last element
of @arr2, add 3 to @arr1 = (5, 3).
4th operation:
Again the last element of @arr2 is greate than the last element
of @arr1, add 8 to @arr2 = (4, 8)
Mow we have two arrays:
@arr1 = (5, 3)
@arr2 = (4, 8)
Concatenate the two arrays and return the final array: (5, 3, 4, 8).
Last date to submit the solution 23:59 (UK Time) Sunday 19th May 2024.