From 23472215c5ccb0d04ece7f63376f4c7be3c9583d Mon Sep 17 00:00:00 2001 From: Jeremy Walker Date: Sat, 7 Nov 2026 17:00:06 +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 | 13 +++++++++++++ 2 files changed, 16 insertions(+) create mode 100644 docs/SIGN_UP_SNIPPET.txt diff --git a/.github/CODEOWNERS b/.github/CODEOWNERS index 21d359418..0ee8f307b 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 000000000..14bf57b3d --- /dev/null +++ b/docs/SIGN_UP_SNIPPET.txt @@ -0,0 +1,13 @@ +std::string most_common_word(const std::string& text) { + std::map counts; + std::string word, best; + std::istringstream words(text); + while (words >> word) { + for (char& c : word) c = std::tolower(c); + counts[word]++; + if (counts[word] > counts[best]) { + best = word; + } + } + return std::format("\"{}\" appears {} times", best, counts[best]); +}