blob: 69dd53f3dd853ae9e87585f86bc77f252ca866d1 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
|
#!/usr/bin/env perl
# Challenge 005
#
# Challenge #2
# Write a program to find the sequence of characters that has the most anagrams.
#
# create a hash of all words in dictionary where key is sorted list of letters
# therefore two anagrams have the same key
use Modern::Perl;
# read dictionary, count number of keys, i.e. anagrams
my %anagrams;
my $max_anagrams = 0;
open(my $fh, "<", "words.txt") or die "open words.txt: $!\n";
while (<$fh>) {
chomp;
next if /\W/;
next if length($_) < 2;
my $num_anagrams = ++$anagrams{word_key($_)};
$max_anagrams = $num_anagrams if $max_anagrams < $num_anagrams;
}
# output all sequences with $max_anagrams
say "Maximum of $max_anagrams anagrams";
for (sort keys %anagrams) {
say $_ if $anagrams{$_} == $max_anagrams;
}
sub word_key {
my($word) = @_;
$word =~ s/\W//g;
my @letters = sort split //, lc($word);
return join '', @letters;
}
|
