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

export function mostUsedChar(text) {
    // implementar logica aqui
    const charMap = {};
            let max = 0;
            let charMax = '';

            for (let character of text) {
                if (charMap[character] === undefined) {
                    charMap[character] = 1;
                } else {
                    
                    charMap[character] = charMap[character] + 1;
                    if (charMap[character] > max) {
                        max = charMap[character];
                        charMax = character;
                    }
                }
            }

            return charMax;
        }

        // Resultados esperados
        console.log(mostUsedChar("fdgdfgff"), 'f') // f
        console.log(mostUsedChar("Lorem ipsum"), 'm') // m
        console.log(mostUsedChar("adsassdasd"), 's') // s
        console.log(mostUsedChar("testeeeee"), 'e') // e