forked from M3-Academy/challenge-algorithms-v2.0
feat: solucao mostRepeatedChar #9
@ -1,4 +1,17 @@
|
||||
export function mostUsedChar(text) {
|
||||
// implementar logica aqui
|
||||
return ""
|
||||
}
|
||||
// implementar logica aqui
|
||||
let arr = text.toLowerCase().split("").sort();
|
||||
let mostRepeated = null;
|
||||
let moreOccurrences = -1;
|
||||
|
||||
let count = 1;
|
||||
for (let i = 1; i <= arr.length; i++) {
|
||||
if (i < arr.length && arr[i] === arr[i - count]) {
|
||||
count++;
|
||||
} else if (count > moreOccurrences) {
|
||||
mostRepeated = arr[i - 1];
|
||||
moreOccurrences = count;
|
||||
}
|
||||
}
|
||||
return `${mostRepeated}`;
|
||||
}
|
||||
|
Loading…
Reference in New Issue
Block a user