[Purdue-pm] Purdue Weekly Challenge - 005

[Mark Senn]

The challenges were

  1.  Write a program which prints out all anagrams for a given word.

  2.  Write a program to find the sequence of characters that has the
      most anagrams.

I used a Perl 6 hash of arrays to solve the problem.  See
https://engineering.purdue.edu/~mark/pwc-005.pdf for blog
entry with details about some Perl 6 one-liners, the math,
the code, etc.

-mark