add anagram solution (#62)

Co-authored-by: lucaferranti <[email protected]>

config.json

@@ -8,16 +8,16 @@
     "representer": false,
     "analyzer": false
   },
-  "test_runner": {
-    "average_run_time": 10
-  },
   "blurb": "Chapel is a programming language designed for productive parallel computing at scale.",
   "version": 3,
   "online_editor": {
     "indent_style": "space",
     "indent_size": 2,
     "highlightjs_language": "chapel"
   },
+  "test_runner": {
+    "average_run_time": 10
+  },
   "files": {
     "solution": [
       "src/%{kebab_slug}.chpl"
@@ -209,19 +209,17 @@
         "practices": [],
         "prerequisites": [],
         "difficulty": 1
+      },
+      {
+        "slug": "anagram",
+        "name": "Anagram",
+        "uuid": "b2d3f839-29fe-4659-94bf-5b14ad39d1bd",
+        "practices": [],
+        "prerequisites": [],
+        "difficulty": 3
       }
     ]
   },
-  "tags": [
-    "execution_mode/compiled",
-    "paradigm/imperative",
-    "paradigm/object_oriented",
-    "platform/linux",
-    "platform/mac",
-    "runtime/standalone_executable",
-    "typing/static",
-    "used_for/scientific_calculations"
-  ],
   "key_features": [
     {
       "title": "Open source",
@@ -253,5 +251,15 @@
       "content": "Chapel is a great fit for applications involving heavy computations or big data analysis",
       "icon": "scientific"
     }
+  ],
+  "tags": [
+    "execution_mode/compiled",
+    "paradigm/imperative",
+    "paradigm/object_oriented",
+    "platform/linux",
+    "platform/mac",
+    "runtime/standalone_executable",
+    "typing/static",
+    "used_for/scientific_calculations"
   ]
 }

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

@@ -0,0 +1,13 @@
+# Instructions
+
+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"`.
+
+Given a target word and a set of candidate words, this exercise requests the anagram set: the subset of the candidates that are anagrams of the target.
+
+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/.meta/config.json

@@ -0,0 +1,18 @@
+{
+  "authors": ["lucaferranti"],
+  "contributors": ["kytrinyx"],
+  "files": {
+    "solution": [
+      "src/anagram.chpl"
+    ],
+    "test": [
+      "test/tests.chpl"
+    ],
+    "example": [
+      ".meta/reference.chpl"
+    ]
+  },
+  "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/reference.chpl

@@ -0,0 +1,16 @@
+module Anagram {
+
+  use Sort;
+
+  proc normaliseString(s: string) {
+   var v = [c in s] c.toLower();
+   sort(v);
+   return "".join(v);
+  }
+
+  proc findAnagrams(s: string, candidates: [] string) {
+    const normalised = normaliseString(s);
+    return [c in candidates] if c.toLower() != s.toLower() && normaliseString(c) == normalised then c;
+  }
+
+}

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"

exercises/practice/anagram/Mason.toml

@@ -0,0 +1,5 @@
+[brick]
+name="anagram"
+version="0.1.0"
+chplVersion="1.33.0"
+type="application"

exercises/practice/anagram/src/anagram.chpl

@@ -0,0 +1,3 @@
+module Anagram {
+  // Write your solution here.
+}

exercises/practice/anagram/test/tests.chpl

@@ -0,0 +1,74 @@
+use UnitTest;
+
+use Anagram;
+
+proc testNoMatches(test : borrowed Test) throws {
+  var anagrams = findAnagrams("diaper", ["hello", "world", "zombies", "pants"]);
+  test.assertTrue(anagrams.isEmpty());
+}
+
+proc testDetectsTwoAnagrams(test : borrowed Test) throws {
+  var anagrams = findAnagrams("solemn", ["lemons", "cherry", "melons"]);
+  test.assertEqual(anagrams, ["lemons", "melons"]);
+}
+
+proc testDoesNotDetectAnagramSubsets(test : borrowed Test) throws {
+  var anagrams = findAnagrams("good", ["dog", "goody"]);
+  test.assertTrue(anagrams.isEmpty());
+}
+
+proc testDetectsAnagram(test : borrowed Test) throws {
+  var anagrams = findAnagrams("listen", ["enlists", "google", "inlets", "banana"]);
+  test.assertEqual(anagrams, ["inlets"]);
+}
+
+proc testDetectsThreeAnagrams(test : borrowed Test) throws {
+  var anagrams = findAnagrams("allergy", ["gallery", "ballerina", "regally", "clergy", "largely", "leading"]);
+  test.assertEqual(anagrams, ["gallery", "regally", "largely"]);
+}
+proc testDetectsMultipleAnagramsWithDifferentCase(test : borrowed Test) throws {
+  var anagrams = findAnagrams("nose", ["Eons", "ONES"]);
+  test.assertEqual(anagrams, ["Eons", "ONES"]);
+}
+proc testDoesNotDetectNonAnagramsWithIdenticalChecksum(test : borrowed Test) throws {
+  var anagrams = findAnagrams("mass", ["last"]);
+  test.assertTrue(anagrams.isEmpty());
+}
+proc testDetectsAnagramsCaseInsensitively(test : borrowed Test) throws {
+  var anagrams = findAnagrams("Orchestra", ["cashregister", "Carthorse", "radishes"]);
+  test.assertEqual(anagrams, ["Carthorse"]);
+}
+proc testDetectsAnagramsUsingCaseInsensitiveSubject(test : borrowed Test) throws {
+  var anagrams = findAnagrams("Orchestra", ["cashregister", "carthorse", "radishes"]);
+  test.assertEqual(anagrams, ["carthorse"]);
+}
+proc testDetectsAnagramsUsingCaseInsensitivePossibleMatches(test : borrowed Test) throws {
+  var anagrams = findAnagrams("orchestra", ["cashregister", "Carthorse", "radishes"]);
+  test.assertEqual(anagrams, ["Carthorse"]);
+}
+proc testDoesNotDetectAnAnagramIfTheOriginalWordIsRepeated(test : borrowed Test) throws {
+  var anagrams = findAnagrams("go", ["go Go GO"]);
+  test.assertTrue(anagrams.isEmpty());
+}
+proc testAnagramsMustUseAllLettersExactlyOnce(test : borrowed Test) throws {
+  var anagrams = findAnagrams("tapper", ["patter"]);
+  test.assertTrue(anagrams.isEmpty());
+}
+proc testWordsAreNotAnagramsOfThemselves(test : borrowed Test) throws {
+  var anagrams = findAnagrams("BANANA", ["BANANA"]);
+  test.assertTrue(anagrams.isEmpty());
+}
+proc testWordsAreNotAnagramsOfThemselvesEvenIfLetterCaseIsPartiallyDifferent(test : borrowed Test) throws {
+  var anagrams = findAnagrams("BANANA", ["Banana"]);
+  test.assertTrue(anagrams.isEmpty());
+}
+proc testWordsAreNotAnagramsOfThemselvesEvenIfLetterCaseIsCompletelyDifferent(test : borrowed Test) throws {
+  var anagrams = findAnagrams("BANANA", ["banana"]);
+  test.assertTrue(anagrams.isEmpty());
+}
+proc testWordsOtherThanThemselvesCanBeAnagrams(test : borrowed Test) throws {
+  var anagrams = findAnagrams("LISTEN", ["LISTEN", "Silent"]);
+  test.assertEqual(anagrams, ["Silent"]);
+}
+
+UnitTest.main();