Clearify we only output a number, not a sequence of operations.

2 files changed, 22 insertions, 0 deletions

diff --git a/challenge-096/abigail/README.md b/challenge-096/abigail/README.md
index 5c7ebe0027..ff3190658c 100644
--- a/challenge-096/abigail/README.md
+++ b/challenge-096/abigail/README.md
@@ -19,6 +19,17 @@ Input: $S = "    Perl and   Raku are  part of the same family  "
 Output: "family same the of part are Raku and Perl"
 ~~~~
 
+### Notes
+
+The challenge isn't quite clear on whether we should output a number
+(the minimal number of operations required), or the actual operations.
+The examples show both -- but separated by a blank line. Previous
+challenges typically use a blank line to separate the required output
+from the explaination on why that it is the correct answer.
+
+We're opting to only print the number of operations, not the actual
+operations.
+
 ### Solutions
 * [AWK](awk/ch-1.awk)
 * [Bash](sh/ch-1.sh)
diff --git a/challenge-096/abigail/perl/ch-2.pl b/challenge-096/abigail/perl/ch-2.pl
index 45aa08416b..c84dec7ad1 100755
--- a/challenge-096/abigail/perl/ch-2.pl
+++ b/challenge-096/abigail/perl/ch-2.pl
@@ -20,6 +20,17 @@ use experimental 'lexical_subs';
 use List::Util 'min';
 
 #
+# The challenge isn't quite clear on whether we should output a number
+# (the minimal number of operations required), or the actual operations.
+# The examples show both -- but separated by a blank line. Previous
+# challenges typically use a blank line to separate the required output
+# from the explaination on why that it is the correct answer.
+#
+# We're opting to only print the number of operations, not the actual
+# operations.
+#
+
+#
 # This is an implementation of the Wagner Fischer algorithm, which
 # calculates the Levenshtein distance.
 #