Just changing max fn right , hahaha

Thx.

i should equal 1, there is no reason to compare arr[0] to itself.

O(nlogn)

Just wanted to fix the tests and try this kumite thing oout ;)

It goes to minus infinity, math logarithmic expressions look if you want

Additional test cases added

If you want to use totally inefficient approach, then yes, you can.

you can also do it like ;

findMax = a => a.sort((x, y) => x - y ).pop()

thanks

What if numners are all negative

Well, the code you provided actually counts how many of each char there was. But nvm, it's fine.

i thought that kumite is trying to find max value in a string...was my idea

What does this have to do with this kumite? :/

let s = 'lollipooooop';
var result = [...s].reduce((a, e) => {
a[e] = a[e] ? a[e] + 1 : 1;
return a
}, {});
console.log(result);