aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--challenge-190/kueppo-wesley/Perl/ch-2.pl5
1 files changed, 3 insertions, 2 deletions
diff --git a/challenge-190/kueppo-wesley/Perl/ch-2.pl b/challenge-190/kueppo-wesley/Perl/ch-2.pl
index 065874316c..2546e0dbdb 100644
--- a/challenge-190/kueppo-wesley/Perl/ch-2.pl
+++ b/challenge-190/kueppo-wesley/Perl/ch-2.pl
@@ -12,9 +12,10 @@ use Test::Deep;
=head1 PROBLEM
Given C<X> and C<Y>, words from different encodings and C<F>, a function
-which transliterates the alphabets between these encodings. The
-primary issue is that composed alphabets are also alphabets.
+which transliterates the alphabets between these encodings.
+The primary issue is that the results of composed alphabets are also alphabets.
+So, get all possible C<Y>s from C<X>.
=head1 SOLUTION