challenge-algorithms-v2.0-n.../09-mostRepeatedChar/index.js

19 lines
676 B
JavaScript

export function mostUsedChar(text) {
// implementar logica aqui
let textLower = text.toLowerCase().split('');
let caractereMaisRepetido;
let numeroDeCaractereRepetido = 0;
textLower.forEach(element => {
let caracteresRepetidos = textLower.filter((x) => x === element);
if (caracteresRepetidos.length > numeroDeCaractereRepetido) {
caractereMaisRepetido = caracteresRepetidos.filter((caractere, indice) => {
return caracteresRepetidos.indexOf(caractere) === indice
})
numeroDeCaractereRepetido = caracteresRepetidos.length
}
});
return caractereMaisRepetido.toString()
}