Perl Weekly Challenge - 036

Sunday, Nov 24, 2019| Tags: Perl, Raku


HEADLINES



With great pleasure, we announce Steven Wilson as the winner of “Perl Weekly Challenge - 035”. Congratulations Steven, you should soon hear from Perl Careers about your reward. For rest of the participants, I would say Good Luck for next time. Keep sending in your solutions and share your knowledge with each other.

A gentle reminder to all members, please send us your nominated solutions for the Advent Calendar 2019. It would be a great help. So far we have shortlisted 4 solutions, 20 more to go for the Advent Calendar 2019. You could email (perlweeklychallenge@yahoo.com) us or PM on twitter.



RECAP



Here is the recap of last week “Perl Weekly Challenge - 035”.



PERL REVIEW



Please checkout Perl solutions review of the “Perl Weekly Challenge - 034” by Kian-Meng Ang.

If you missed any past reviews then please checkout the collection.



RAKU REVIEW



Please checkout Raku solutions review of the “Perl Weekly Challenge - 034” by Laurent Rosenfeld.

Laurent also reviewed Task #1 of “Perl Weekly Challenge - 005”.

If you missed any past reviews then please checkout 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



No new member joined last week.

Check out current team members.

Please find out How to contribute?, if you have any doubts.



GUESTS



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



TASK #1



Write a program to validate given Vehicle Identification Number (VIN). For more information, please checkout wikipedia.



TASK #2



Write a program to solve Knapsack Problem.


There are 5 color coded boxes with varying weights and amounts in GBP. Which boxes should be choosen to maximize the amount of money while still keeping the overall weight under or equal to 15 kgs?

R: (weight = 1 kg, amount = £1)
B: (weight = 1 kg, amount = £2)
G: (weight = 2 kg, amount = £2)
Y: (weight = 12 kg, amount = £4)
P: (weight = 4 kg, amount = £10)

Bonus task, what if you were allowed to pick only 2 boxes or 3 boxes or 4 boxes? Find out which combination of boxes is the most optimal?



Last date to submit the solution 23:59 (UK Time) Sunday 1st December 2019.



SO WHAT DO YOU THINK ?

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

Contact with me