The Weekly Challenge

9. TASK #2: Binary Tree to Linked List

HEADLINES

Welcome to the first edition of weekly challenge in the year 2021.

Today is the first Monday of the month and time to declare the Champion. With great pleasure, I announce Niels van Dijke as the Champion. Niels joined the Team PWC in the week 61. As of today, he has contributed 62 Perl solutions.

We have a new member Ben Bullock joining the Team PWC. Welcome on board Ben.

Contributions Summary

This week, we had 23 contributions by guests in 11 different languages. I would like to THANK each and every guest contributors.

Languages Summary

While we are talking about contributions, lets share some interesting stats from the GitHub repository.

1) Commits: 12,845 (+164)

2) Pull Requests: 3,141 (+49)

3) Contributors: 156 (+2)

4) Fork: 194

5) Stars: 87

Last but not the least, I would like to thank each and every member for their support and encouragement.

RECAP

Quick recap of the “The Weekly Challenge - 093” by Mohammad S Anwar.

PERL REVIEW

Please checkout Perl solutions review of the “Perl Weekly Challenge - 091” by Colin Crain.

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

RAKU REVIEW

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

Ben Bullock, an experienced Perl hacker from Japan.

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

Please give it a try to an excellent tool EZPWC created by respected member Saif Ahmed of Team PWC.

GUESTS

01) Lubos Kolouch shared solutions to Task #1 and Task #2 in Python.

02) Mohammad Meraj Zia shared solution to Task #2 in Java.

03) Nuno Vieira shared solutions to Task #1 and Task #2 in JavaScript.

04) Paulo Custodio shared solutions to Task #1 and Task #2 in Basic.

05) Paulo Custodio shared solutions to Task #1 and Task #2 in C.

06) Paulo Custodio shared solutions to Task #1 and Task #2 in C++.

07) Paulo Custodio shared solutions to Task #1 and Task #2 in Forth.

08) Roger Bell_West shared solutions to Task #1 and Task #2 in Python.

09) Roger Bell_West shared solutions to Task #1 and Task #2 in Ruby.

10) Roger Bell_West shared solutions to Task #1 and Task #2 in Rust.

11) Stuart Little shared solutions to Task #1 and Task #2 in Haskell.

12) Tyler Wardhaugh shared solutions to Task #1 and Task #2 in Clojure.

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

TASK #1 › Group Anagrams

Submitted by: Mohammad S Anwar

You are given an array of strings @S.

Write a script to group Anagrams together in any random order.

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

Example 1:

    Input: ("opt", "bat", "saw", "tab", "pot", "top", "was")
    Output: [ ("bat", "tab"),
              ("saw", "was"),
              ("top", "pot", "opt") ]

Example 2:

    Input: ("x")
    Output: [ ("x") ]

TASK #2 › Binary Tree to Linked List

Submitted by: Mohammad S Anwar

You are given a binary tree.

Write a script to represent the given binary tree as an object and flatten it to a linked list object. Finally print the linked list object.

Example:

    Input:

        1
       / \
      2   3
     / \
    4   5
       / \
      6   7

    Output:

        1 -> 2 -> 4 -> 5 -> 6 -> 7 -> 3

Last date to submit the solution 23:59 (UK Time) Sunday 10th January 2021.