challenge-algorithms-v2.0-ramon-dias-ferreira/09-mostRepeatedChar/index.js

export function mostUsedChar(text) {
    let max = 0,
        maxChar = '';
     text.split('').forEach(function(char){
       if(text.split(char).length > max) {
           max = text.split(char).length;
           maxChar = char;
        }
     });
     return maxChar;
}