forked from M3-Academy/challenge-algorithms-v2.0
23 lines
624 B
JavaScript
23 lines
624 B
JavaScript
export function isAnagram(word1, word2) {
|
|
let word1Lower = Array.from(word1.toLowerCase());
|
|
let word2Lower = Array.from(word2.toLowerCase());
|
|
if (word1Lower.length !== word2Lower.length) {
|
|
return false;
|
|
}
|
|
let contador = 0;
|
|
while (word1.length !== contador) {
|
|
let letraword2 = word2Lower[0];
|
|
if (word1Lower.indexOf(letraword2) !== -1) {
|
|
let indice = word1Lower.indexOf(letraword2);
|
|
word1Lower.splice(indice, 1);
|
|
word2Lower.shift();
|
|
}
|
|
contador = contador + 1;
|
|
}
|
|
if (word1Lower.length === 0 && word2Lower.length === 0) {
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|