The Weekly Challenge - 299

Monday, Dec 9, 2024| Tags: Perl, Raku

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: Replace Words

10. TASK #2: Word Search


HEADLINES


Welcome to the Week #299 of The Weekly Challenge.


Advent Calendar 2024


Day 1: Leaping from Tree to Tree as They Float Down the Mighty Rivers of British Columbia by Dave Jacoby.

Day 2: Special Zeroes by Jorg Sommrey.

Day 3: Split the weakest by Peter Campbell Smith.

Day 4: Reverse Power by Arne Sommer.

Day 5: Odd Character / Most Frequent Word by Laurent Rosenfeld.

Day 6: Easy Pairs - Easy Merge by Matthias Muth.

Day 7: Smaller than Echelon by Roger Bell_West.

Day 8: Count Sumofvaluacula by Adam Russell.

Day 9: Target Index / Merge Items by James Smith.



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

  Week      Perl       Raku       Blog   
   294       37       21       10   
   295       45       20       24   
   296       49       19       16   
   297       44       20       23   
   298       33       16       21   

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

  Week      Guests       Contributions       Languages   
   294       10       46       18   
   295       10       45       18   
   296       11       49       17   
   297       13       53       18   
   298       9       45       19   

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     (3091)
 2. Rust       (808)
 3. Ruby       (751)
 4. Haskell    (727)
 5. Lua        (668)
 6. C          (589)
 7. C++        (569)
 8. JavaScript (514)
 9. Go         (438)
10. BQN        (395)

Blogs with Creative Title


1. Maximal Right by Arne Sommer.

2. The Right Square by Jorg Sommrey.

3. arrays and matrixes by Luca Ferrari.

4. Maximally Indexed Indices by Matthias Muth.

5. Turn right at the big square by Peter Campbell Smith.

6. Whatever You Do, Be Maximally Right by Roger Bell_West.

7. Maximizing the interval by Simon Green.


GitHub Repository Stats


1. Commits: 41,479 (+91)

2. Pull Requests: 11,269 (+34)

3. Contributors: 254

4. Fork: 321

5. Stars: 178



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

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


Task 1: Replace Words

Submitted by: Mohammad Sajid Anwar

You are given an array of words and a sentence.

Write a script to replace all words in the given sentence that start with any of the words in the given array.

Example 1

Input: @words = ("cat", "bat", "rat")
       $sentence = "the cattle was rattle by the battery"
Output: "the cat was rat by the bat"

Example 2

Input: @words = ("a", "b", "c")
       $sentence = "aab aac and cac bab"
Output: "a a a c b"

Example 3

Input: @words = ("man", "bike")
       $sentence = "the manager was hit by a biker"
Output: "the man was hit by a bike"

Task 2: Word Search

Submitted by: Mohammad Sajid Anwar

You are given a grid of characters and a string.

Write a script to determine whether the given string can be found in the given grid of characters. You may start anywhere and take any orthogonal path, but may not reuse a grid cell.

Example 1

Input: @chars = (['A', 'B', 'D', 'E'],
                 ['C', 'B', 'C', 'A'],
                 ['B', 'A', 'A', 'D'],
                 ['D', 'B', 'B', 'C'])
      $str = 'BDCA'
Output: true

Example 2

Input: @chars = (['A', 'A', 'B', 'B'],
                 ['C', 'C', 'B', 'A'],
                 ['C', 'A', 'A', 'A'],
                 ['B', 'B', 'B', 'B'])
      $str = 'ABAC'
Output: false

Example 3

Input: @chars = (['B', 'A', 'B', 'A'],
                 ['C', 'C', 'C', 'C'],
                 ['A', 'B', 'A', 'B'],
                 ['B', 'B', 'A', 'A'])
      $str = 'CCCAA'
Output: true


Last date to submit the solution 23:59 (UK Time) Sunday 15th December 2024.


SO WHAT DO YOU THINK ?

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

Contact with me