Perl Weekly Challenge has been very innovative with so many unique solutions. Thanks to all the members for participating and blogging about it. Keep the momentum up. Good luck with this week challenge, I am sure you will find it fun and enjoyable.
RECAP
Here is the recap of last week challenge.
CHART
Please take a look at the charts showing interesting data.
I would like to thank everyone for your valuable suggestions. Please do share your experience with us. Good luck for the weekly challenge, enjoy.
Task 1: Niven numbers
Print all the niven numbers from 0 to 50 inclusive, each on their own line. A niven number is a non-negative number that is divisible by the sum of its digits.
Task 2: Word ladders
A word ladder is a sequence of words [w0, w1, …, wn] such that each word wi in the sequence is obtained by changing a single character in the word wi-1. All words in the ladder must be valid English words. Given two input words and a file that contains an ordered word list, implement a routine (e.g., find_shortest_ladder(word1, word2, wordlist)) that finds the shortest ladder between the two input words. For example, for the words cold and warm, the routine might return: (“cold”, “cord”, “core”, “care”, “card”, “ward”, “warm”) However, there’s a shortest ladder: (“cold”, “cord”, “card”, “ward”, “warm”).
Last date to submit the solution 6 pm (UK Time) Sunday 12th May 2019.