challenge-algorithms-v2.0-caio-thurler/09-mostRepeatedChar/index.js

export function mostUsedChar(text) {
    // implementar logica aqui
    let max = 0;
    let mostRep = '';
        text.split('').forEach(function (index) {
             if (text.split(index).length > max ) {
             max = text.split(index).length;
             mostRep = index;
          }
        }
    ); 
    return mostRep;
}