findFirstMaxOccurrence

Problem Definition

Given a string, find its first Most Repeated character

Given a string, find the first most repeatedcharacter in it. For example, if the input string is “GeeksforGeeks”, then output should be ‘e’ and if input string is “GeeksQuiz”, then output should be ‘G’.

If the string was "aaabbb" the output would be "a", and if the string was "abbccbccb" the output would be b.

Questions

• Is there a specific time / space complexity you want it in?
• How do you want me to handle an empty input?

Complexity

• The time complexity of this problem is O(2n) since in the worst case we could loop through the string twice. This reduces to O(n).
• The space complexity of this problem is O(n), since if every character in the string is different, the hash would contain each character