aboutsummaryrefslogtreecommitdiff
path: root/challenge-092
diff options
context:
space:
mode:
authorJoel Crosswhite <joel.crosswhite@ix.netcom.com>2020-12-27 15:16:17 -0700
committerJoel Crosswhite <joel.crosswhite@ix.netcom.com>2020-12-27 15:16:17 -0700
commit350981cf08d97969e41073017ed0da75e0534381 (patch)
tree43409608d688ced92dd8ce078be8da957db4fbf2 /challenge-092
parent2d6c21078c0ab843395343c8dfd2327a4e83cd60 (diff)
downloadperlweeklychallenge-club-350981cf08d97969e41073017ed0da75e0534381.tar.gz
perlweeklychallenge-club-350981cf08d97969e41073017ed0da75e0534381.tar.bz2
perlweeklychallenge-club-350981cf08d97969e41073017ed0da75e0534381.zip
Spelling correction.
Diffstat (limited to 'challenge-092')
-rw-r--r--challenge-092/jcrosswh/perl/ch-1.pl2
1 files changed, 1 insertions, 1 deletions
diff --git a/challenge-092/jcrosswh/perl/ch-1.pl b/challenge-092/jcrosswh/perl/ch-1.pl
index f16596b367..0f4fcb4629 100644
--- a/challenge-092/jcrosswh/perl/ch-1.pl
+++ b/challenge-092/jcrosswh/perl/ch-1.pl
@@ -24,7 +24,7 @@ are isomorphic. It will print 1 if they are otherwise 0.
This solution assumes that if the number of characters in each string is equal,
then the two strings are isomorphic. This script works by going though all
-characters, assuming case sensetivity, and determining in each inputed string
+characters, assuming case sensitivity, and determining in each inputed string
the number of times that character appears. Internally the script maintains a
hash that keys on the number of times a character appears, and that key maps to
an array that captures which characters appeared that number of times.