Perl Weekly Challenge - 012

Monday, Jun 10, 2019| Tags: Perl5, Perl6

With every week, the team is growing and participation is also growing. I also love the fact that members even taking on optional API challenge regularly now. I hope, you are having fun solving weekly challenges as much as I am.


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 their valuable suggestions. Please do share your experience with us. Good luck for the weekly challenge and enjoy.


NEW MEMBERS

  1. Matthew Persico, Perl 5 hacker from New York, USA.

  2. Aaron Sherman, Perl 5 / Perl 6 hacker from Somerville, MA.

  3. Feng Chang, perl hacker from Beijing, China since 1999.


Challenge #1

The numbers formed by adding one to the products of the smallest primes are called the Euclid Numbers (see wiki). Write a script that finds the smallest Euclid Number that is not prime. This challenge was proposed by Laurent Rosenfeld.


Challenge #2

Write a script that finds the common directory path, given a collection of paths and directory separator. For example, if the following paths are supplied.

/a/b/c/d
/a/b/cd
/a/b/cc
/a/b/c/d/e

and the path separator is /. Your script should return /a/b as common directory path.


Challenge #3

Find out the synonyms of a given word using the Synonyms API. The API challenge is optional but would love to see your solution.


Last date to submit the solution 6 pm (UK Time) Sunday 16th June 2019.

SO WHAT DO YOU THINK ?

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

Contact with me