challenge-algorithms-v2.0-saulo-klein-nery/09-mostRepeatedChar/index.js

export function mostUsedChar(text) {
    // implementar logica aqui
    text.trim().toLowerCase();
    let bigger = 0;
    let mostUsed = '';

    for(const char of text){
        if(text.split(char).length > bigger){
            bigger = text.split(char).length;
            mostUsed = char; 
        }
    }

    return mostUsed;
}