Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

updated description of anagrams exercise #1928

Merged
merged 3 commits into from
Feb 1, 2022
Merged

updated description of anagrams exercise #1928

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
a974d01
updated description of anagrams
BartMassey Jan 19, 2022
0f4aa5b
changed anagram description to be one-sentence-per-line
BartMassey Jan 20, 2022
0c9f321
updated description of anagrams to use sets
BartMassey Jan 25, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
23 changes: 18 additions & 5 deletions exercises/anagram/description.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,21 @@
# Description

An anagram is a rearrangement of letters to form a new word.
Given a word and a list of candidates, select the sublist of anagrams of the given word.
An anagram is a rearrangement of letters to form a new word:
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Our Markdown style guide has a one sentence per line rule.
It is true that not many exercises do yet follow this guideline, but it might be good to apply that rule to this PR.
See https://github.com/exercism/problem-specifications/pull/1911/files for an example.

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 `"listen"` and a list of candidates like `"enlists" "google"
"inlets" "banana"` the program should return a list containing
`"inlets"`.
Given a target word and a list of candidate words, this
exercise requests the anagram list: the sublist of the
candidates that are anagrams of the target.

The target and candidates are words in ASCII alphabetic
characters (`A`-`Z` and `a`-`z`). Lowercase and uppercase
characters are equivalent: for example, `"PoTS"` is an
anagram of `"sTOp"`. The candidate set is represented as an
unordered list. The anagram set must be the sublist of all
anagrams in the candidate set (in the same order).

Given the target `"stone"` and candidates `"stone"`,
`"tones"`, `"banana"`, `"tones"`, `"tons"`, `"notes"`, `"Seton"`, the
anagram list is `"tones"`, `"tones"`, `"notes"`, `"Seton"`.