Given a string str consisting of lowercase English alphabets. The task is to find whether there is any character in the string whose frequency is equal to the sum of the frequencies of other characters of the string. If such character exists then print Yes else print No.
Input: str = “hkklkwwwww”
frequency(w) = frequency(h) + frequency(k) + frequency(l)
4 = 1 + 2 + 1
4 = 4
Input: str = “geeksforgeeks”
Approach: If the length of the string is odd then the result will always be No. In case of even length string, calculate the frequency of each of the character of the string and for any character if it’s frequency = half of the length of the string then the result will be Yes else No.
Below is the implementation of the above approach:
Time Complexity: O(len) where len is the length of the given string.
- Longest sub-string having frequency of each character less than equal to k
- Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
- Maximum length prefix such that frequency of each character is atmost number of characters with minimum frequency
- XOR of Prime Frequencies of Characters in a String
- Check whether the frequencies of all the characters in a string are prime or not
- Sum and Product of Prime Frequencies of Characters in a String
- Minimum operations to make frequency of all characters equal K
- Remove even frequency characters from the string
- Maximum repeated frequency of characters in a given string
- String with frequency of characters in Lucas Sequence
- Check if the frequency of any character is more than half the length of the string
- Index of character depending on frequency count in string
- Check if a string has all characters with same frequency with one variation allowed
- Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
- Lexicographically smallest string formed by appending a character from the first K characters of a given string
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.