Given a string **S **containing lowercase English characters, the task is to find the frequency of all the characters in the string.

Examples:

Input:_ S=”geeksforgeeks”_

Output:

e – 4

f – 1

g – 2

k – 2

o – 1

r – 1

s – 2

Input: S=”gfg”

Output:

f – 1

g – 2

Approach: Follow the steps to solve the problem:

1. Initialize an array freq[] to store the frequency of each alphabet in the given string. The 0th index stores the frequency of the character ‘a’, 1st/sup> index stores the frequency of the character ‘b’ and so on.
2. Iterate over the given string S and increment the frequency of each character encountered by 1, by performing freq[S[i] – ‘a’] += 1. If S[i] = ‘a’, then S[i] – ‘a’ is equal to 0, therefore the frequency of ‘a’ is incremented in the array.=
3. After complete traversal of the string, print the frequency of all the characters in the string by traversing the array freq[].

#c programs #hash #strings #frequency-counting #c++