Merge branch 'exercism:main' into mazy-mice

Author: rabestro

.github/dependabot.yml

@@ -6,4 +6,4 @@ updates:
   - package-ecosystem: 'github-actions'
     directory: '/'
     schedule:
-      interval: 'daily'
+      interval: 'monthly'

.github/workflows/action-format.yml

@@ -12,7 +12,7 @@ jobs:
     steps:
       - name: 'Post acknowledgement that it will format code'
         continue-on-error: true # Never fail the build if this fails
-        uses: actions/github-script@d7906e4ad0b1822421a7e6a35d5ca353c962f410
+        uses: actions/github-script@60a0d83039c74a4aee543508d2ffcb1c3799cdea
         with:
           github-token: ${{ secrets.GITHUB_TOKEN }}
           script: |
@@ -65,7 +65,7 @@ jobs:
         run: ./bin/reorder-keys
 
       - name: Use Node.js LTS (16.x)
-        uses: actions/setup-node@5e21ff4d9bc1a8cf6de233a3057d20ec6b3fb69d
+        uses: actions/setup-node@cdca7365b2dadb8aad0a33bc7601856ffabcc48e
         with:
           node-version: '16'
 
@@ -75,7 +75,7 @@ jobs:
         run: echo "::set-output name=dir::$(yarn cache dir)"
 
       - name: Cache yarn
-        uses: actions/cache@704facf57e6136b1bc63b828d79edcd491f0ee84
+        uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684
         id: yarn-cache
         with:
           path: ${{ steps.yarn-cache-dir-path.outputs.dir }}
@@ -90,7 +90,7 @@ jobs:
         run: yarn format-json && ruby bin/format-array.rb
 
       - name: Format Markdown files
-        run: yarn format-md
+        run: yarn format-md && ruby bin/format-admonition-fences.rb
 
       - name: 'Commit formatted code'
         run: |
@@ -111,7 +111,7 @@ jobs:
 
       - name: 'Post acknowledgement that it has formatted the code'
         continue-on-error: true # Never fail the build if this fails
-        uses: actions/github-script@d7906e4ad0b1822421a7e6a35d5ca353c962f410
+        uses: actions/github-script@60a0d83039c74a4aee543508d2ffcb1c3799cdea
         with:
           github-token: ${{ secrets.GITHUB_TOKEN }}
           script: |
@@ -125,7 +125,7 @@ jobs:
       - name: 'Post reminder to trigger build manually'
         continue-on-error: true # Never fail the build if this fails
         if: steps.fork_status.outputs.fork == 'true'
-        uses: actions/github-script@d7906e4ad0b1822421a7e6a35d5ca353c962f410
+        uses: actions/github-script@60a0d83039c74a4aee543508d2ffcb1c3799cdea
         with:
           github-token: ${{ secrets.GITHUB_TOKEN }}
           script: |

.github/workflows/ci.yml

@@ -12,22 +12,22 @@ jobs:
     name: All required files are present
     runs-on: ubuntu-22.04
     steps:
-      - uses: actions/checkout@3df4ab11eba7bda6032a0b82a6bb43b11571feac # v4.0.0
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.0.0
 
       - name: All required files are present
         run: bin/check_required_files_present
 
   immutability:
     name: No test has been mutated
-    runs-on: ubuntu-20.04
+    runs-on: ubuntu-24.04
     steps:
-      - uses: actions/checkout@3df4ab11eba7bda6032a0b82a6bb43b11571feac # v4.0.0
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.0.0
         with:
           path: "new"
 
       # Pull Requests
       - name: Checkout the target branch
-        uses: actions/checkout@3df4ab11eba7bda6032a0b82a6bb43b11571feac # v4.0.0
+        uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.0.0
         with:
           ref: "${{ github.base_ref }}"
           path: "old"
@@ -43,10 +43,10 @@ jobs:
     name: Schema validation
     runs-on: ubuntu-22.04
     steps:
-      - uses: actions/checkout@3df4ab11eba7bda6032a0b82a6bb43b11571feac # v4.0.0
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.0.0
 
       - name: Setup nodejs
-        uses: actions/setup-node@5e21ff4d9bc1a8cf6de233a3057d20ec6b3fb69d # v3.8.1
+        uses: actions/setup-node@cdca7365b2dadb8aad0a33bc7601856ffabcc48e # v4.3.0
         with:
           node-version: 16
           cache: "yarn"
@@ -115,16 +115,16 @@ jobs:
     name: Lint markdown files
     runs-on: ubuntu-22.04
     steps:
-      - uses: actions/checkout@3df4ab11eba7bda6032a0b82a6bb43b11571feac # v4.0.0
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.0.0
 
       - name: Lint markdown
-        uses: DavidAnson/markdownlint-cli2-action@bb4bb94c73936643d73d345b48fead3e96f90a5e # v10.0.1
+        uses: DavidAnson/markdownlint-cli2-action@05f32210e84442804257b2a6f20b273450ec8265 # v19.1.0
         with:
           globs: |
             **/*.md
 
       - name: Setup nodejs
-        uses: actions/setup-node@5e21ff4d9bc1a8cf6de233a3057d20ec6b3fb69d # v3.8.1
+        uses: actions/setup-node@cdca7365b2dadb8aad0a33bc7601856ffabcc48e # v4.3.0
         with:
           node-version: 16
           cache: "yarn"
@@ -134,9 +134,9 @@ jobs:
 
       - name: Verify that markdown files are formatted correctly
         run: |
-          yarn format-md
+          yarn format-md && ruby bin/format-admonition-fences.rb
           if ! git diff --quiet --exit-code; then
-            echo "please format the files with prettier, or apply the following changes:"
+            echo "please format the files using 'yarn format-md && ruby bin/format-admonition-fences.rb', or apply the following changes:"
             git diff
             exit 1
           fi
@@ -145,10 +145,10 @@ jobs:
     name: Check links
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@3df4ab11eba7bda6032a0b82a6bb43b11571feac # v4.0.0
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.0.0
 
       - name: Check links
-        uses: lycheeverse/lychee-action@ec3ed119d4f44ad2673a7232460dc7dff59d2421 # 1.8.0
+        uses: lycheeverse/lychee-action@1d97d84f0bc547f7b25f4c2170d87d810dc2fb2c # 2.4.0
         with:
           args: --require-https --user-agent "Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/100.0.4896.75 Safari/537.36" --no-progress **/*.md **/*.html **/*.toml **/*.json
           fail: true
@@ -159,10 +159,10 @@ jobs:
     name: Lint json files
     runs-on: ubuntu-22.04
     steps:
-      - uses: actions/checkout@3df4ab11eba7bda6032a0b82a6bb43b11571feac # v4.0.0
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.0.0
 
       - name: Setup nodejs
-        uses: actions/setup-node@5e21ff4d9bc1a8cf6de233a3057d20ec6b3fb69d # v3.8.1
+        uses: actions/setup-node@cdca7365b2dadb8aad0a33bc7601856ffabcc48e # v4.3.0
         with:
           node-version: 16
           cache: "yarn"

.github/workflows/rebase.yml

@@ -11,7 +11,7 @@ jobs:
     runs-on: ubuntu-22.04
 
     steps:
-    - uses: actions/checkout@3df4ab11eba7bda6032a0b82a6bb43b11571feac
+    - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683
       with:
         fetch-depth: 0
 

.github/workflows/shellcheck.yml

@@ -13,7 +13,7 @@ jobs:
     runs-on: ubuntu-22.04
     steps:
       - name: Checkout
-        uses: actions/checkout@3df4ab11eba7bda6032a0b82a6bb43b11571feac # v4.0.0
+        uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.0.0
 
       - name: Run shellcheck
         uses: ludeeus/action-shellcheck@00cae500b08a931fb5698e11e79bfbd38e612a38 # 2.0.0

.lycheeignore

@@ -2,3 +2,4 @@ json-schema.org
 collinsdictionary\.com
 papyr\.com
 users.csc.calpoly.edu
+www\.udacity\.com

CODE_OF_CONDUCT.md

@@ -90,4 +90,4 @@ This policy was initially adopted from the Front-end London Slack community and
 A version history can be seen on [GitHub](https://github.com/exercism/website-copy/edit/main/pages/code_of_conduct.md).
 
 _This policy is a "living" document, and subject to refinement and expansion in the future.
-This policy applies to the Exercism website, the Exercism GitHub organization, any other Exercism-related communication channels (e.g. Slack, Twitter, email) and any other Exercism entity or event._
+This policy applies to the Exercism website, the Exercism GitHub organization, any other Exercism-related communication channels (e.g. Discord, Forum, Twitter, email) and any other Exercism entity or event._

bin/format-admonition-fences.rb

@@ -0,0 +1,10 @@
+#!/usr/bin/env ruby
+
+BACKTICK_MATCH_REGEX = /(?<fence>[`~]{3,})(?<type>exercism\/[a-z]+)(?<admonition>.*?)(?<end>\k<fence>)/m.freeze
+TILDE_REPLACE = '~~~~\k<type>\k<admonition>~~~~'.freeze
+
+Dir.glob('exercises/**/*.md') do |filepath|
+  contents = File.read(filepath)
+  contents.gsub!(BACKTICK_MATCH_REGEX, TILDE_REPLACE)
+  File.write(filepath, contents)
+end

canonical-data.schema.json

@@ -22,7 +22,7 @@
     " slightly reducing the amount of manually generated code.   "
   ],
 
-  "$schema": "http://json-schema.org/draft-04/schema#",
+  "$schema": "http://json-schema.org/draft-07/schema#",
 
   "self": {
     "vendor": "io.exercism",

exercises/acronym/metadata.toml

@@ -2,3 +2,5 @@ title = "Acronym"
 blurb = "Convert a long phrase to its acronym."
 source = "Julien Vanier"
 source_url = "https://github.com/monkbroc"
+deep_dive_youtube_id = "ofzqp4MFHvM"
+deep_dive_blurb = "We take a gentle dive into regular expressions starting with basic whitespace matching, exploring unicode, and ending with negative lookbehinds. We finish off by looking at some other approaches to Acronym including state machines."

exercises/affine-cipher/description.md

@@ -4,7 +4,7 @@ Create an implementation of the affine cipher, an ancient encryption system crea
 
 The affine cipher is a type of monoalphabetic substitution cipher.
 Each character is mapped to its numeric equivalent, encrypted with a mathematical function and then converted to the letter relating to its new numeric value.
-Although all monoalphabetic ciphers are weak, the affine cipher is much stronger than the atbash cipher, because it has many more keys.
+Although all monoalphabetic ciphers are weak, the affine cipher is much stronger than the Atbash cipher, because it has many more keys.
 
 [//]: # " monoalphabetic as spelled by Merriam-Webster, compare to polyalphabetic "
 
@@ -18,10 +18,10 @@ E(x) = (ai + b) mod m
 
 Where:
 
-- `i` is the letter's index from `0` to the length of the alphabet - 1
+- `i` is the letter's index from `0` to the length of the alphabet - 1.
 - `m` is the length of the alphabet.
-  For the Roman alphabet `m` is `26`.
-- `a` and `b` are integers which make the encryption key
+  For the Latin alphabet `m` is `26`.
+- `a` and `b` are integers which make up the encryption key.
 
 Values `a` and `m` must be _coprime_ (or, _relatively prime_) for automatic decryption to succeed, i.e., they have number `1` as their only common factor (more information can be found in the [Wikipedia article about coprime integers][coprime-integers]).
 In case `a` is not coprime to `m`, your program should indicate that this is an error.

exercises/all-your-base/description.md

@@ -0,0 +1,28 @@
+# Instructions
+
+Convert a sequence of digits in one base, representing a number, into a sequence of digits in another base, representing the same number.
+
+~~~~exercism/note
+Try to implement the conversion yourself.
+Do not use something else to perform the conversion for you.
+~~~~
+
+## About [Positional Notation][positional-notation]
+
+In positional notation, a number in base **b** can be understood as a linear combination of powers of **b**.
+
+The number 42, _in base 10_, means:
+
+`(4 × 10¹) + (2 × 10⁰)`
+
+The number 101010, _in base 2_, means:
+
+`(1 × 2⁵) + (0 × 2⁴) + (1 × 2³) + (0 × 2²) + (1 × 2¹) + (0 × 2⁰)`
+
+The number 1120, _in base 3_, means:
+
+`(1 × 3³) + (1 × 3²) + (2 × 3¹) + (0 × 3⁰)`
+
+_Yes. Those three numbers above are exactly the same. Congratulations!_
+
+[positional-notation]: https://en.wikipedia.org/wiki/Positional_notation

exercises/all-your-base/instructions.md

@@ -0,0 +1,8 @@
+# Introduction
+
+You've just been hired as professor of mathematics.
+Your first week went well, but something is off in your second week.
+The problem is that every answer given by your students is wrong!
+Luckily, your math skills have allowed you to identify the problem: the student answers _are_ correct, but they're all in base 2 (binary)!
+Amazingly, it turns out that each week, the students use a different base.
+To help you quickly verify the student answers, you'll be building a tool to translate between bases.

exercises/all-your-base/introduction.md

@@ -2,3 +2,5 @@ title = "Allergies"
 blurb = "Given a person's allergy score, determine whether or not they're allergic to a given item, and their full list of allergies."
 source = "Exercise by the JumpstartLab team for students at The Turing School of Software and Design."
 source_url = "https://turing.edu"
+deep_dive_youtube_id = "OFS9sknfpkc"
+deep_dive_blurb = "We explore bit shifting, bitwise comparison and other binary number concepts! We also take a look at a solution using pattern matching and an interesting approach in Erlang using recursion."

exercises/allergies/metadata.toml

@@ -1,6 +1,6 @@
 # Description
 
-Write a function to solve alphametics puzzles.
+Given an alphametics puzzle, find the correct solution.
 
 [Alphametics][alphametics] is a puzzle where letters in words are replaced with numbers.
 
@@ -26,6 +26,4 @@ This is correct because every letter is replaced by a different number and the w
 
 Each letter must represent a different digit, and the leading digit of a multi-digit number must not be zero.
 
-Write a function to solve alphametics puzzles.
-
 [alphametics]: https://en.wikipedia.org/wiki/Alphametics

exercises/alphametics/description.md

@@ -1,2 +1,2 @@
 title = "Alphametics"
-blurb = "Write a function to solve alphametics puzzles."
+blurb = "Given an alphametics puzzle, find the correct solution."

exercises/alphametics/metadata.toml

@@ -132,6 +132,17 @@
       },
       "expected": []
     },
+    {
+      "uuid": "630abb71-a94e-4715-8395-179ec1df9f91",
+      "reimplements": "7cc195ad-e3c7-44ee-9fd2-d3c344806a2c",
+      "description": "does not detect an anagram if the original word is repeated",
+      "property": "findAnagrams",
+      "input": {
+        "subject": "go",
+        "candidates": ["goGoGO"]
+      },
+      "expected": []
+    },
     {
       "uuid": "9878a1c9-d6ea-4235-ae51-3ea2befd6842",
       "description": "anagrams must use all letters exactly once",
@@ -205,6 +216,29 @@
         "candidates": ["LISTEN", "Silent"]
       },
       "expected": ["Silent"]
+    },
+    {
+      "uuid": "a6854f66-eec1-4afd-a137-62ef2870c051",
+      "description": "handles case of greek letters",
+      "scenarios": ["unicode"],
+      "property": "findAnagrams",
+      "input": {
+        "subject": "ΑΒΓ",
+        "candidates": ["ΒΓΑ", "ΒΓΔ", "γβα", "αβγ"]
+      },
+      "expected": ["ΒΓΑ", "γβα"]
+    },
+    {
+      "uuid": "fd3509e5-e3ba-409d-ac3d-a9ac84d13296",
+      "description": "different characters may have the same bytes",
+      "comments": ["a⬂ => 61 E2 AC 82", "€a => E2 82 AC 61"],
+      "scenarios": ["unicode"],
+      "property": "findAnagrams",
+      "input": {
+        "subject": "a⬂",
+        "candidates": ["€a"]
+      },
+      "expected": []
     }
   ]
 }