Given a string S containing lowercase English characters, the task is to find the frequency of all the characters in the string.
e – 4
f – 1
g – 2
k – 2
o – 1
r – 1
s – 2
f – 1
g – 2
Approach: Follow the steps to solve the problem:
- 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.
- 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.=
- After complete traversal of the string, print the frequency of all the characters in the string by traversing the array freq.
Below is the implementation of the above approach:
e - 4 f - 1 g - 2 k - 2 o - 1 r - 1 s - 2
Time Complexity: O(N)
Auxiliary Space: O(26)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.
In case you wish to attend live classes with industry experts, please refer Geeks Classes Live