from all members: - accepted / - tried
Given a non-empty string, return the most frequently ocurring character.
If there are multiple characters with same occurrance, return an array of them.
count('abbccc') // 'c' count('abbcccddd') // ['c', 'd']
Follow-up: What is the time & space complexity of your approach?