One test case fail in problem string max frequency character

#1

Here is my code: https://ide.codingblocks.com/s/205869

What is missing in this?

#2

You logic is wrong.
Maintain a frequency count of each character in an array. And finally print the character with maximum frequency.

Consider as case:
bbbbaaacbaaa

You o/p:
b

Expected o/p
a

#3

I think my logic is right when I sorting the string before entering into my function

#4

my updated code: https://ide.codingblocks.com/s/207118

#5

Is you code passing the test cases?

#6

You should try using hashing concepts. It will be more efficient than sorting.

#7

yes it pass all the test cases