Highest Occuring Character

For a given a string(str), find and return the highest occurring character.

Example:

Input String: "abcdeapapqarr"
Expected Output: 'a'
Since 'a' has appeared four times in the string which happens to be the highest frequency character, the answer would be 'a'.

If there are two characters in the input string with the same frequency, return the character which comes first.

Consider:

Assume all the characters in the given string to be in lowercase always.

Input Format:

The first and only line of input contains a string without any leading and trailing spaces.

Output Format:

The only line of output prints the updated string. 

Note:

You are not required to print anything explicitly. It has already been taken care of.

Constraints:

0 <= N <= 10^6
Where N is the length of the input string.

Time Limit: 1 second

Sample Input 1:

abdefgbabfba

Sample Output 1:

b

Sample Input 2:

xy

Sample Output 2:

x

 #include <iostream>

#include <cstring>

using namespace std;

#include "solution.h"

char highestOccurringChar(char str[]) { 

    // Create array to keep the count of individual 

    // characters and initialize the array as 0 

    int count[256] = {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]]++; 

        

    } 

    for (int i = 0; i < len; i++){

    if ( count[str[i]]>max ) { 

            max = count[str[i]]; 

            result = str[i]; 

        } 

    }

  

    return result; 

} 

int main() {

    int size = 1e6;

    char str[size];

    cin >> str;

    cout << highestOccurringChar(str);

}