anagram-exercise: Added anagram exercise.

config.json

@@ -384,6 +384,14 @@
         "practices": [],
         "prerequisites": [],
         "difficulty": 5
+      },
+      {
+        "slug": "anagram",
+        "name": "Anagram",
+        "uuid": "031c8337-ee79-4487-bd23-5ee425515cbe",
+        "practices": [],
+        "prerequisites": [],
+        "difficulty": 5
       }
     ]
   },

exercises/practice/anagram/.docs/instructions.append.md

@@ -0,0 +1,3 @@
+# Hints
+
+The result should be a string with anagrams separated by a comma (e.g., `"hello,world"`).

exercises/practice/anagram/.docs/instructions.md

@@ -0,0 +1,13 @@
+# Instructions
+
+Your task is to, given a target word and a set of candidate words, to find the subset of the candidates that are anagrams of the target.
+
+An anagram is a rearrangement of letters to form a new word: for example `"owns"` is an anagram of `"snow"`.
+A word is _not_ its own anagram: for example, `"stop"` is not an anagram of `"stop"`.
+
+The target and candidates are words of one or more ASCII alphabetic characters (`A`-`Z` and `a`-`z`).
+Lowercase and uppercase characters are equivalent: for example, `"PoTS"` is an anagram of `"sTOp"`, but `StoP` is not an anagram of `sTOp`.
+The anagram set is the subset of the candidate set that are anagrams of the target (in any order).
+Words in the anagram set should have the same letter case as in the candidate set.
+
+Given the target `"stone"` and candidates `"stone"`, `"tones"`, `"banana"`, `"tons"`, `"notes"`, `"Seton"`, the anagram set is `"tones"`, `"notes"`, `"Seton"`.

exercises/practice/anagram/.docs/introduction.md

@@ -0,0 +1,12 @@
+# Introduction
+
+At a garage sale, you find a lovely vintage typewriter at a bargain price!
+Excitedly, you rush home, insert a sheet of paper, and start typing away.
+However, your excitement wanes when you examine the output: all words are garbled!
+For example, it prints "stop" instead of "post" and "least" instead of "stale."
+Carefully, you try again, but now it prints "spot" and "slate."
+After some experimentation, you find there is a random delay before each letter is printed, which messes up the order.
+You now understand why they sold it for so little money!
+
+You realize this quirk allows you to generate anagrams, which are words formed by rearranging the letters of another word.
+Pleased with your finding, you spend the rest of the day generating hundreds of anagrams.

exercises/practice/anagram/.meta/config.json

@@ -0,0 +1,19 @@
+{
+  "authors": [
+    "SimaDovakin"
+  ],
+  "files": {
+    "solution": [
+      "src/anagram.cob"
+    ],
+    "test": [
+      "tst/anagram/anagram.cut"
+    ],
+    "example": [
+      ".meta/proof.ci.cob"
+    ]
+  },
+  "blurb": "Given a word and a list of possible anagrams, select the correct sublist.",
+  "source": "Inspired by the Extreme Startup game",
+  "source_url": "https://github.com/rchatley/extreme_startup"
+}

exercises/practice/anagram/.meta/proof.ci.cob

@@ -0,0 +1,178 @@
+       IDENTIFICATION DIVISION.
+       PROGRAM-ID. ANAGRAM.
+       ENVIRONMENT DIVISION.
+       CONFIGURATION SECTION.
+       REPOSITORY.
+        FUNCTION ALL INTRINSIC.
+       DATA DIVISION.
+       WORKING-STORAGE SECTION.
+       01 WS-SUBJECT PIC X(20).
+       01 WS-CANDIDATES-COUNT PIC 9.
+       01 WS-CANDIDATES-TABLE.
+           02 WS-CANDIDATES OCCURS 1 TO 20
+                            DEPENDING ON WS-CANDIDATES-COUNT.
+              05 WS-CANDIDATE PIC X(20).
+       01 WS-RESULT-LIST PIC X(48).
+
+       01 WS-INDEX PIC 9(3).
+       01 WS-CANDIDATE-INDEX PIC 9.
+       01 WS-MULT BINARY-LONG.
+       01 WS-WORD-CODE BINARY-LONG.
+       01 WS-STRING PIC X(20).
+       01 WS-STRING-LENGTH PIC 9(2).
+       01 WS-SEPARATOR PIC X.
+       01 WS-IS-ANAGRAM PIC X.
+       01 WS-SUBJECT-CODE BINARY-LONG.
+       01 WS-LOWERED-SUBJECT PIC X(20).
+       01 WS-LOWERED-CANDIDATE PIC X(20).
+
+       PROCEDURE DIVISION.
+
+       FIND-ANAGRAMS.
+        MOVE SPACE TO WS-RESULT-LIST
+        MOVE SPACE TO WS-SEPARATOR
+        MOVE LOWER-CASE(TRIM(WS-SUBJECT)) TO WS-LOWERED-SUBJECT
+        MOVE WS-LOWERED-SUBJECT TO WS-STRING
+        PERFORM WORD-PRIMERIZATION
+        MOVE WS-WORD-CODE TO WS-SUBJECT-CODE
+
+        PERFORM VARYING WS-CANDIDATE-INDEX FROM 1 BY 1
+                UNTIL WS-CANDIDATE-INDEX > WS-CANDIDATES-COUNT
+          MOVE LOWER-CASE(TRIM(WS-CANDIDATES(WS-CANDIDATE-INDEX)))
+           TO WS-STRING
+
+          PERFORM IS-ANAGRAMS
+
+          IF WS-IS-ANAGRAM = "T"
+             STRING
+               WS-RESULT-LIST DELIMITED BY SPACE
+               WS-SEPARATOR DELIMITED BY SPACE
+               WS-CANDIDATES(WS-CANDIDATE-INDEX) DELIMITED BY SPACE
+               INTO WS-RESULT-LIST
+             END-STRING
+             MOVE "," TO WS-SEPARATOR
+          END-IF
+
+        END-PERFORM.
+
+       IS-ANAGRAMS.
+        MOVE "F" TO WS-IS-ANAGRAM
+        PERFORM WORD-PRIMERIZATION
+        IF WS-LOWERED-SUBJECT <> WS-STRING
+           AND WS-SUBJECT-CODE = WS-WORD-CODE
+           MOVE "T" TO WS-IS-ANAGRAM
+        END-IF.
+
+       WORD-PRIMERIZATION.
+        MOVE 1 TO WS-WORD-CODE
+        MOVE 1 TO WS-INDEX
+        MOVE LENGTH(WS-STRING) TO WS-STRING-LENGTH
+
+        PERFORM VARYING WS-INDEX FROM 1 BY 1
+           UNTIL WS-INDEX > WS-STRING-LENGTH
+           EVALUATE WS-STRING(WS-INDEX:1)
+           WHEN 'a'
+               MOVE 2 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'b'
+               MOVE 3 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'c'
+               MOVE 5 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'd'
+               MOVE 7 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'e'
+               MOVE 11 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'f'
+               MOVE 13 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'g'
+               MOVE 17 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'h'
+               MOVE 19 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'i'
+               MOVE 23 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'j'
+               MOVE 29 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'k'
+               MOVE 31 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'l'
+               MOVE 37 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'm'
+               MOVE 41 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'n'
+               MOVE 43 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'o'
+               MOVE 47 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'p'
+               MOVE 53 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'q'
+               MOVE 59 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'r'
+               MOVE 61 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 's'
+               MOVE 67 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 't'
+               MOVE 71 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'u'
+               MOVE 73 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'v'
+               MOVE 79 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'w'
+               MOVE 83 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'x'
+               MOVE 89 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'y'
+               MOVE 97 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+           WHEN 'z'
+               MOVE 101 TO WS-MULT
+               MULTIPLY WS-WORD-CODE BY WS-MULT
+               GIVING WS-WORD-CODE
+        END-PERFORM.

exercises/practice/anagram/.meta/tests.toml

@@ -0,0 +1,86 @@
+# This is an auto-generated file.
+#
+# Regenerating this file via `configlet sync` will:
+# - Recreate every `description` key/value pair
+# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications
+# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion)
+# - Preserve any other key/value pair
+#
+# As user-added comments (using the # character) will be removed when this file
+# is regenerated, comments can be added via a `comment` key.
+
+[dd40c4d2-3c8b-44e5-992a-f42b393ec373]
+description = "no matches"
+
+[b3cca662-f50a-489e-ae10-ab8290a09bdc]
+description = "detects two anagrams"
+include = false
+
+[03eb9bbe-8906-4ea0-84fa-ffe711b52c8b]
+description = "detects two anagrams"
+reimplements = "b3cca662-f50a-489e-ae10-ab8290a09bdc"
+
+[a27558ee-9ba0-4552-96b1-ecf665b06556]
+description = "does not detect anagram subsets"
+
+[64cd4584-fc15-4781-b633-3d814c4941a4]
+description = "detects anagram"
+
+[99c91beb-838f-4ccd-b123-935139917283]
+description = "detects three anagrams"
+
+[78487770-e258-4e1f-a646-8ece10950d90]
+description = "detects multiple anagrams with different case"
+
+[1d0ab8aa-362f-49b7-9902-3d0c668d557b]
+description = "does not detect non-anagrams with identical checksum"
+
+[9e632c0b-c0b1-4804-8cc1-e295dea6d8a8]
+description = "detects anagrams case-insensitively"
+
+[b248e49f-0905-48d2-9c8d-bd02d8c3e392]
+description = "detects anagrams using case-insensitive subject"
+
+[f367325c-78ec-411c-be76-e79047f4bd54]
+description = "detects anagrams using case-insensitive possible matches"
+
+[7cc195ad-e3c7-44ee-9fd2-d3c344806a2c]
+description = "does not detect an anagram if the original word is repeated"
+include = false
+
+[630abb71-a94e-4715-8395-179ec1df9f91]
+description = "does not detect an anagram if the original word is repeated"
+reimplements = "7cc195ad-e3c7-44ee-9fd2-d3c344806a2c"
+
+[9878a1c9-d6ea-4235-ae51-3ea2befd6842]
+description = "anagrams must use all letters exactly once"
+
+[85757361-4535-45fd-ac0e-3810d40debc1]
+description = "words are not anagrams of themselves (case-insensitive)"
+include = false
+
+[68934ed0-010b-4ef9-857a-20c9012d1ebf]
+description = "words are not anagrams of themselves"
+reimplements = "85757361-4535-45fd-ac0e-3810d40debc1"
+
+[589384f3-4c8a-4e7d-9edc-51c3e5f0c90e]
+description = "words are not anagrams of themselves even if letter case is partially different"
+reimplements = "85757361-4535-45fd-ac0e-3810d40debc1"
+
+[ba53e423-7e02-41ee-9ae2-71f91e6d18e6]
+description = "words are not anagrams of themselves even if letter case is completely different"
+reimplements = "85757361-4535-45fd-ac0e-3810d40debc1"
+
+[a0705568-628c-4b55-9798-82e4acde51ca]
+description = "words other than themselves can be anagrams"
+include = false
+
+[33d3f67e-fbb9-49d3-a90e-0beb00861da7]
+description = "words other than themselves can be anagrams"
+reimplements = "a0705568-628c-4b55-9798-82e4acde51ca"
+
+[a6854f66-eec1-4afd-a137-62ef2870c051]
+description = "handles case of greek letters"
+
+[fd3509e5-e3ba-409d-ac3d-a9ac84d13296]
+description = "different characters may have the same bytes"