Java Coding Problems

14. Finding the character with the most appearances

A pretty straightforward solution relies on HashMap. This solution consists of three steps:

1. First, loop the characters of the given string and put the pairs of the key-value in HashMap where the key is the current character and the value is the current number of occurrences
2. Second, compute the maximum value in HashMap (for example, using Collections.max()) representing the maximum number of occurrences
3. Finally, get the character that has the maximum number of occurrences by looping the HashMap entry set

The utility method returns Pair<Character, Integer> containing the character with the most appearances and the number of appearances (notice that the white spaces are ignored). If you don't ...