add anagram

config.json

@@ -52,6 +52,14 @@
         "prerequisites": [],
         "difficulty": 2
       },
+      {
+        "slug": "anagram",
+        "name": "Anagram",
+        "uuid": "6c2eca3e-c286-403f-8419-06473223618b",
+        "practices": [],
+        "prerequisites": [],
+        "difficulty": 2
+      },
       {
         "slug": "bob",
         "name": "Bob",

exercises/practice/all-your-base/tests/AllYourBase_test.res

@@ -1,8 +1,7 @@
 open Test
 open AllYourBase
 
-let assertEqual = (~message=?, a: 'a, b: 'a) =>
-  assertion(~message?, ~operator="assertEqual", (a, b) => a == b, a, b)
+let assertEqual = (~message=?, a: 'a, b: 'a) => assertion(~message?, ~operator="assertEqual", (a, b) => a == b, a, b)
 
 test("single bit one to decimal", () => {
   assertEqual(~message="single bit one to decimal", rebase(2, [1], 10), Some([1]))
@@ -17,11 +16,7 @@ test("single decimal to binary", () => {
 })
 
 test("binary to multiple decimal", () => {
-  assertEqual(
-    ~message="binary to multiple decimal",
-    rebase(2, [1, 0, 1, 0, 1, 0], 10),
-    Some([4, 2]),
-  )
+  assertEqual(~message="binary to multiple decimal", rebase(2, [1, 0, 1, 0, 1, 0], 10), Some([4, 2]))
 })
 
 test("decimal to binary", () => {

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

@@ -0,0 +1,12 @@
+# Instructions
+
+Given a target word and one or more candidate words, your task is to find 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 word and candidate words are made up 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 words you need to find should be taken from the candidate words, using the same letter case.
+
+Given the target `"stone"` and the candidate words `"stone"`, `"tones"`, `"banana"`, `"tons"`, `"notes"`, and `"Seton"`, the anagram words you need to find are `"tones"`, `"notes"`, and `"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/.gitignore

@@ -0,0 +1,2 @@
+node_modules
+**/*.res.js

exercises/practice/anagram/.meta/Anagram.res

@@ -0,0 +1,23 @@
+let toChars = (word: string): string => {
+  word
+  ->String.toLowerCase
+  ->String.split("")
+  ->Array.toSorted(String.compare)
+  ->Array.join("")
+}
+
+let isAnagram = (base: string, word: string): bool => {
+  let lowerBase = String.toLowerCase(base)
+  let lowerWord = String.toLowerCase(word)
+
+  String.length(base) == String.length(word) &&
+  lowerBase != lowerWord &&
+  toChars(lowerBase) == toChars(lowerWord)
+}
+
+let findAnagrams = (subject, candidates) => {
+  switch candidates->Array.filter(word => isAnagram(subject, word)) {
+  | [] => None
+  | result => Some(result)
+  }
+}

exercises/practice/anagram/.meta/Anagram.resi

@@ -0,0 +1 @@
+let findAnagrams: (string, array<string>) => option<array<string>>

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

@@ -0,0 +1,27 @@
+{
+  "authors": [
+    "stevejb71",
+    "therealowenrees"
+  ],
+  "contributors": [
+    "naartjie",
+    "ohana54",
+    "tejasbubane"
+  ],
+  "files": {
+    "solution": [
+      "src/Anagram.res",
+      "src/Anagram.resi"
+    ],
+    "test": [
+      "tests/Anagram_test.res"
+    ],
+    "example": [
+      ".meta/Anagram.res",
+      ".meta/Anagram.resi"
+    ]
+  },
+  "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/testTemplate.js

@@ -0,0 +1,23 @@
+import path from 'node:path';
+import { fileURLToPath } from 'node:url';
+import { assertEqual } from "../../../../test_generator/assertions.js";
+import { generateTests } from '../../../../test_generator/testGenerator.js';
+
+const __dirname = path.dirname(fileURLToPath(import.meta.url));
+const slug = path.basename(path.resolve(__dirname, '..'))
+
+// EDIT THIS WITH YOUR ASSERTIONS
+export const assertionFunctions = [ assertEqual ]
+
+// EDIT THIS WITH YOUR TEST TEMPLATES
+export const template = (c) => {
+  const { subject, candidates } = c.input
+
+  const expectedStr = c.expected.length > 0
+    ? `Some(${JSON.stringify(c.expected)})`
+    : "None"
+
+  return `assertEqual(~message="${c.description}", findAnagrams("${subject}", ${JSON.stringify(candidates)}), ${expectedStr})`
+}
+
+generateTests(__dirname, slug, assertionFunctions, template)

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/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Exercism
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.