Write an efficient function to return maximum occurring character in the input string e.g., if input string is “test” then function should return ‘t’.
Algorithm:
One obvious approach to solve this problem would be to sort the input string and then traverse through the sorted string to find the character which is occurring maximum number of times. Let us see if we can improve on this. So we will use a technique called ‘Hashing’. In this, when we traverse through the string, we would hash each character into an array of ASCII characters.
Input string = “test” 1: Construct character count array from the input string. count['e'] = 1 count['s'] = 1 count['t'] = 2 2: Return the index of maximum value in count array (returns ‘t’).
Typically, ASCII characters are 256, so we use our Hash array size as 256. But if we know that our input string will have characters with value from 0 to 127 only, we can limit Hash array size as 128. Similarly, based on extra info known about input string, the Hash array size can be limited to 26.
Implementation:
C++
// C++ program to output the maximum occurring character // in a string #include<bits/stdc++.h> #define ASCII_SIZE 256 using namespace std; char getMaxOccuringChar(char* str) { // Create array to keep the count of individual // characters and initialize the array as 0 int count[ASCII_SIZE] = {0}; // Construct character count array from the input // string. int len = strlen(str); int max = 0; // Initialize max count char result; // Initialize result // Traversing through the string and maintaining // the count of each character for (int i = 0; i < len; i++) { count[str[i]]++; if (max < count[str[i]]) { max = count[str[i]]; result = str[i]; } } return result; } // Driver program to test the above function int main() { char str[] = "sample string"; cout << "Max occurring character is " << getMaxOccuringChar(str); } |
Java
// Java program to output the maximum occurring character // in a string public class GFG { static final int ASCII_SIZE = 256; static char getMaxOccuringChar(String str) { // Create array to keep the count of individual // characters and initialize the array as 0 int count[] = new int[ASCII_SIZE]; // Construct character count array from the input // string. int len = str.length(); for (int i=0; i<len; i++) count[str.charAt(i)]++; int max = -1; // Initialize max count char result = ' '; // Initialize result // Traversing through the string and maintaining // the count of each character for (int i = 0; i < len; i++) { if (max < count[str.charAt(i)]) { max = count[str.charAt(i)]; result = str.charAt(i); } } return result; } // Driver Method public static void main(String[] args) { String str = "sample string"; System.out.println("Max occurring character is " + getMaxOccuringChar(str)); } } |
Python
# Python program to return the maximum occurring character in the input string ASCII_SIZE = 256 def getMaxOccuringChar(str): # Create array to keep the count of individual characters # Initialize the count array to zero count = [0] * ASCII_SIZE # Utility variables max = -1 c = '' # Traversing through the string and maintaining the count of # each character for i in str: count[ord(i)]+=1; for i in str: if max < count[ord(i)]: max = count[ord(i)] c = i return c # Driver program to test the above function str = "sample string"print "Max occurring character is " + getMaxOccuringChar(str) # Although this program can be written in atmost 3 lines in Python # the above program has been written for a better understanding of # the reader # Shorter version of the program # import collections # str = "sample string" # print "Max occurring character is " + # collections.Counter(str).most_common(1)[0][0] # This code has been contributed by Bhavya Jain |
C#
// C# program to output the maximum // occurring character in a string using System; class GFG { static int ASCII_SIZE = 256; static char getMaxOccuringChar(String str) { // Create array to keep the count of // individual characters and // initialize the array as 0 int []count = new int[ASCII_SIZE]; // Construct character count array // from the input string. int len = str.Length; for (int i = 0; i < len; i++) count[str[i]]++; int max = -1; // Initialize max count char result = ' '; // Initialize result // Traversing through the string and // maintaining the count of each character for (int i = 0; i < len; i++) { if (max < count[str[i]]) { max = count[str[i]]; result = str[i]; } } return result; } // Driver Method public static void Main() { String str = "sample string"; Console.Write("Max occurring character is " + getMaxOccuringChar(str)); } } // This code is contributed by Sam007 |
PHP
<?php // PHP program to output the maximum // occurring character in a string $ASCII_SIZE = 256; function getMaxOccuringChar($str) { global $ASCII_SIZE; // Create array to keep the count // of individual characters and // initialize the array as 0 $count = array_fill(0, $ASCII_SIZE, NULL); // Construct character count array // from the input string. $len = strlen($str); $max = 0; // Initialize max count // Traversing through the string // and maintaining the count of // each character for ($i = 0; $i < ($len); $i++) { $count[ord($str[$i])]++; if ($max < $count[ord($str[$i])]) { $max = $count[ord($str[$i])]; $result = $str[$i]; } } return $result; } // Driver Code $str = "sample string"; echo "Max occurring character is " . getMaxOccuringChar($str); // This code is contributed by ita_c ?> |
Output:
Max occurring character is s
Time Complexity: O(n)
Space Complexity: O(1) — Because we are using fixed space (Hash array) irrespective of input string size.
Notes:
If more than one characters have the same count and that count is maximum then the function returns the first character with maximum count in input string. For example if input string is “test sample” then there are three characters with same and maximum count two i.e. “t”, “e” and “s” but our program will result “t” because “t” comes first in input string. Similarly, the output for “cbbbbccc” would be “c”.
As an variation to the above program, think about the change in code if you want to output “e” for input “test sample” i.e. the character of maximum count and that character should be of least ASCII value. For “cbbbbccc”, output should be “b”. Try it out !
Also, can you think of improvement if we can avoid two loopings in the above? Basically, you need to figure out if we can solve the same problem with one loop itself instead of two loops.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
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.
Recommended Posts:
- Maximum occurring character in an input string | Set-2
- Find the maximum occurring character after performing the given operations
- Check if max occurring character of one string appears same no. of times in other
- Count substrings with each character occurring at most k times
- Print the most occurring character in an array of strings
- NFA to accept strings that has atleast one character occurring in a multiple of 3
- Frequency of maximum occurring subsequence in given string
- Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
- Count of maximum occurring subsequence using only those characters whose indices are in GP
- Count the number of vowels occurring in all the substrings of given string
- Count of Distinct Substrings occurring consecutively in a given String
- Find a string such that every character is lexicographically greater than its immediate next character
- Replace every character of string by character whose ASCII value is K times more than it
- Replace every character of a string by a different character
- Map every character of one string to another such that all occurrences are mapped to the same character
- Modify the string such that every character gets replaced with the next character in the keyboard
- Replace all occurrences of character X with character Y in given string
- Generate two output strings depending upon occurrence of character in input string.
- Generate two output strings depending upon occurrence of character in input string in Python
- Find the Number Occurring Odd Number of Times
