👋Learning to code? Check out ourCoding Fundamentalscourse for beginners!
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.
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".
The function receives a single string of words, each suffixed with a line break.
The first one is the word the remaining ones are supposed to be anagrams of.
Return a string of all valid anagrams, each suffixed by a line break.
The buffer for the input string uses bytes 64-319 of linear memory.
You may modify this buffer in place if you wish to avoid additional memory allocations.
Edit via GitHub
Sign up to Exercism to learn and master WebAssembly with 73 exercises, and real human mentoring, all for free.
