Are these two an anagram
A word game checks whether one phrase uses exactly the same letters as another.
- Case does not matter.
- Whitespace is ignored entirely.
- Everything else — digits, punctuation — counts as a character that has to match.
- Two empty phrases are an anagram of each other.
IsAnagram(text: string, other: string) → bool
C# needs a compiler and Drill does not host one yet, so this page is the reference rather than an exercise: the problem, worked examples, and the solution in full. To type it out, the same problem runs in Python.
Where you start
public bool IsAnagram(string text, string other) {
}Worked examples
| Call | Result |
|---|---|
IsAnagram("Listen", "Silent") | true |
IsAnagram("a b", "ba") | true |
IsAnagram("hello", "world") | false |
IsAnagram("abc", "ab") | false |
Hint
Strip and lowercase both, then compare the sorted characters, or count them.
Reference solution in C#
public bool IsAnagram(string text, string other) {
var a = text.ToLowerInvariant().Where(c => !char.IsWhiteSpace(c)).OrderBy(c => c).ToArray();
var b = other.ToLowerInvariant().Where(c => !char.IsWhiteSpace(c)).OrderBy(c => c).ToArray();
return a.SequenceEqual(b);
}