aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorPaulo Custodio <pauloscustodio@gmail.com>2024-08-26 10:13:29 +0100
committerPaulo Custodio <pauloscustodio@gmail.com>2024-08-26 10:30:16 +0100
commitbe9df65194dde74bb7f0d9736d0336b47430bcbd (patch)
tree03f1b6905da86f1042142e2a6c6b44871b405502
parent009c16c2546a3c4ac0746a2b8dc524283046ea40 (diff)
downloadperlweeklychallenge-club-be9df65194dde74bb7f0d9736d0336b47430bcbd.tar.gz
perlweeklychallenge-club-be9df65194dde74bb7f0d9736d0336b47430bcbd.tar.bz2
perlweeklychallenge-club-be9df65194dde74bb7f0d9736d0336b47430bcbd.zip
Whitespace
-rw-r--r--challenge-248/paulo-custodio/perl/ch-1.pl3
1 files changed, 2 insertions, 1 deletions
diff --git a/challenge-248/paulo-custodio/perl/ch-1.pl b/challenge-248/paulo-custodio/perl/ch-1.pl
index 503126e926..b99dce5818 100644
--- a/challenge-248/paulo-custodio/perl/ch-1.pl
+++ b/challenge-248/paulo-custodio/perl/ch-1.pl
@@ -7,7 +7,8 @@
#
# You are given a string and a character in the given string.
#
-# Write a script to return an array of integers of size same as length of the given string such that:
+# Write a script to return an array of integers of size same as length of
+# the given string such that:
#
# distance[i] is the distance from index i to the closest occurence of
# the given character in the given string.