Objective: Given a string, write an algorithm to find all the duplicate characters in the string and print its count.
Input String: tutorial horizon Output: Duplicate Characters: r - 2 t - 2 i - 2 o – 3
Approach: Hash Map
- Maintain a Hash Map with Character as key and count as value.
- Iterate through the string, one character at a time.
- Check if the character is present in hashmap, if yes then increment the count of the character in the hashmap and if the character is not present in hashmap then insert it with count 1.
- Once iteration of string is completed, iterate the Hashmap and print all the characters with count > 1.
Duplicate Characters: r - 2 t - 2 i - 2 o - 3