Given a string str, the task is to check if the frequency of any character is more than half the length of the given string. The characters can be lowercase or uppercase alphabets, digits and special characters.
Input: str = “AAa*2AAAA”
The frequency of ‘A’ is more than half the length of the string.
Input: str = “abB@2a”
Approach: The problem can be easily solved by using a frequency array of length 28 i.e. 256 as there are 256 different characters. Iterate through the string and increase the count of the character by one in the frequency array every time it is encountered. Finally, iterate through the frequency array to check if the frequency of any character is more than half the length of the string.
Below is the implementation of the above approach:
- Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
- Length of the largest substring which have character with frequency greater than or equal to half of the substring
- Longest sub-string having frequency of each character less than equal to k
- Index of character depending on frequency count in string
- Character whose frequency is equal to the sum of frequencies of other characters of the given string
- Maximum length substring with highest frequency in a string
- Minimize the length of string by removing occurrence of only one character
- Check if a string has all characters with same frequency with one variation allowed
- Check whether frequency of characters in a string makes Fibonacci Sequence
- Check if both halves of the string have at least one different character
- Check whether the Average Character of the String is present or not
- Check if a two character string can be made using given words
- Check if a string contains a palindromic sub-string of even length
- Check if max occurring character of one string appears same no. of times in other
- Python | Check order of character in string using OrderedDict( )
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.