mirror of
https://github.com/freeCodeCamp/freeCodeCamp.git
synced 2026-05-16 07:00:53 -04:00
Co-authored-by: Kolade Chris <65571316+Ksound22@users.noreply.github.com> Co-authored-by: Huyen Nguyen <25715018+huyenltnguyen@users.noreply.github.com>
1.3 KiB
1.3 KiB
id, title, challengeType, dashedName
| id | title | challengeType | dashedName |
|---|---|---|---|
| 681cb1afdab50c87ddb2e517 | JavaScript Challenge 6: Anagram Checker | 28 | javascript-challenge-6 |
--description--
Given two strings, determine if they are anagrams of each other (contain the same characters in any order).
- Ignore casing and white space.
--hints--
areAnagrams("listen", "silent") should return true.
assert.isTrue(areAnagrams("listen", "silent"));
areAnagrams("School master", "The classroom") should return true.
assert.isTrue(areAnagrams("School master", "The classroom"));
areAnagrams("A gentleman", "Elegant man") should return true.
assert.isTrue(areAnagrams("A gentleman", "Elegant man"));
areAnagrams("Hello", "World") should return false.
assert.isFalse(areAnagrams("Hello", "World"));
areAnagrams("apple", "banana") should return false.
assert.isFalse(areAnagrams("apple", "banana"));
areAnagrams("cat", "dog") should return false.
assert.isFalse(areAnagrams("cat", "dog"));
--seed--
--seed-contents--
function areAnagrams(str1, str2) {
return str1;
}
--solutions--
function areAnagrams(str1, str2) {
const clean = (str) =>
str.replace(/\s+/g, '').toLowerCase().split('').sort().join('');
return clean(str1) === clean(str2);
}