challenge-algorithms-v2.0-Patrick-Reis-Santos/09-mostRepeatedChar/index.js

export function mostUsedChar(text) {
  let freqCounter = [];
  let textStr = text.toLowerCase();

  for (let char of textStr) {
    freqCounter[char] = freqCounter[char] + 1 || 1;
  }

  let maxCount = 0;
  let maxChar = null;

  for (let key in freqCounter) {
    if (freqCounter[key] > maxCount) {
      maxCount = freqCounter[key];
      maxChar = key;
    }
  }
  // implementar logica aqui
  return maxChar;
}