challenge-algorithms-v2.0-henrique-santos-santana/09-mostRepeatedChar/index.js

export function mostUsedChar(text) {
  if (!text) return { error: 'Not Found Text' };

  let max = 0,
    maxChar = '';

  for (let char of text) {
    if (text.split(char).length > max) {
      max = text.split(char).length;
      maxChar = char;
    }
  }

  return maxChar;
}