forked from M3-Academy/challenge-algorithms-v2.0
17 lines
380 B
JavaScript
17 lines
380 B
JavaScript
export function isAnagram(word1, word2)
|
|
for (let index = 0; index < array.length; index++)
|
|
{const element = array[index];
|
|
{
|
|
}
|
|
|
|
function isAnagram(word1, word2) {
|
|
const retorne = word => word
|
|
|
|
.toLowerCase()
|
|
.replace(/[^a-z0-9]/gi, '')
|
|
.split('')
|
|
.sort()
|
|
.join('');
|
|
return retorne(word1) === retorne(word2);
|
|
|
|
} |