From 3b46d0adc26b79cc379dbabe6d560add4b24d189 Mon Sep 17 00:00:00 2001 From: Jeremy Walker Date: Sat, 7 Nov 2026 17:01:10 +0900 Subject: [PATCH] Add a sign-up snippet The Exercism sign-up page shows this code sample to people who say they can code a little, to check whether they understand coding basics. The maintainers-admin team owns the file. Co-Authored-By: Claude Opus 5.5 --- .github/CODEOWNERS | 3 +++ docs/SIGN_UP_SNIPPET.txt | 10 ++++++++++ 2 files changed, 13 insertions(+) create mode 100644 docs/SIGN_UP_SNIPPET.txt diff --git a/.github/CODEOWNERS b/.github/CODEOWNERS index 9386b8d4..46d7e086 100644 --- a/.github/CODEOWNERS +++ b/.github/CODEOWNERS @@ -1,6 +1,9 @@ # Code owners .github/CODEOWNERS @exercism/maintainers-admin +# The code sample shown in the code check when people sign up to Exercism +docs/SIGN_UP_SNIPPET.txt @exercism/maintainers-admin + # Changes to `fetch-configlet` should be made in the `exercism/configlet` repo bin/fetch-configlet @exercism/maintainers-admin bin/fetch-configlet.ps1 @exercism/maintainers-admin diff --git a/docs/SIGN_UP_SNIPPET.txt b/docs/SIGN_UP_SNIPPET.txt new file mode 100644 index 00000000..33df817f --- /dev/null +++ b/docs/SIGN_UP_SNIPPET.txt @@ -0,0 +1,10 @@ +function most_common_word(text, words, counts, n, i, best) { + n = split(tolower(text), words, " ") + best = "" + for (i = 1; i <= n; i++) { + counts[words[i]]++ + if (counts[words[i]] > counts[best]) + best = words[i] + } + return sprintf("\"%s\" appears %d times", best, counts[best]) +}