challenge-algorithms-v2.0-wellington-duarte-santos/09-mostRepeatedChar/index.js

export function mostUsedChar(text) {
    text.toLowerCase();
            
    let sorted = text.split('').sort().join('');

    let cont = 1;
    let repeatedTimes = 0;
    let mostUsed = "";

    for(let i = 0; i < sorted.length; i++){
        if(sorted[i] === sorted[i + 1]){
            cont++;
        }
        else{
            if(cont > repeatedTimes){
                repeatedTimes = cont;
                mostUsed = sorted[i];
            }
            cont = 1;
        }
    }

    return mostUsed;
}