aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJaime <42359730+bracteatus@users.noreply.github.com>2019-07-26 19:04:16 -0600
committerJaime <42359730+bracteatus@users.noreply.github.com>2019-07-26 19:04:16 -0600
commit8730a72d03faaed9e6c4f419e9b06805fb3171f2 (patch)
tree78b4d4e0eb73a1053c322a23f00f423b6aef71c2
parent9c24f79c6aac8a2d5e906a8aefbfb70fe59bc40e (diff)
downloadperlweeklychallenge-club-8730a72d03faaed9e6c4f419e9b06805fb3171f2.tar.gz
perlweeklychallenge-club-8730a72d03faaed9e6c4f419e9b06805fb3171f2.tar.bz2
perlweeklychallenge-club-8730a72d03faaed9e6c4f419e9b06805fb3171f2.zip
Create ch-1.pl
-rw-r--r--challenge-018/jaime/perl5/ch-1.pl8
1 files changed, 8 insertions, 0 deletions
diff --git a/challenge-018/jaime/perl5/ch-1.pl b/challenge-018/jaime/perl5/ch-1.pl
new file mode 100644
index 0000000000..b5cd68a3c6
--- /dev/null
+++ b/challenge-018/jaime/perl5/ch-1.pl
@@ -0,0 +1,8 @@
+#
+# # Challenge #1
+#
+# Write a script that takes 2 or more strings as command line parameters
+# and print the longest common substring. For example, the longest
+# common substring of the strings “ABABC”, “BABCA” and “ABCBA” is string
+# “ABC” of length 3. Other common substrings are “A”, “AB”, “B”, “BA”,
+# “BC” and “C”.