# Find the Maximum Occurring Character in a String in PHP, Java, C, C++, and Python

#### Cyber Security : Go from Zero to Hero

Most Popular

60 Lectures 5.5 hours

#### Master C and Embedded C Programming- Learn as you go

Best Seller

66 Lectures 5.5 hours

#### C Programming from scratch- Master C Programming

Best Seller

60 Lectures 8 hours

In the realm of programming, it's often necessary to find the maximum occurring character in a string. Whether it's for data analysis, text processing, or algorithmic problem-solving, this task is a fundamental operation across various programming languages. In this article, we will delve into different approaches to tackle this problem, providing detailed explanations, algorithms, and implementation examples in PHP, Java, C, C++, and Python.

### Understanding the Problem:

Before diving into the solutions, let's grasp the problem statement. Given a string, we need to determine the character that appears the most frequently. For instance, in the string "hello", the character 'l' appears the most, occurring twice. Our objective is to devise efficient algorithms to identify and output this maximum occurring character.

1. Brute Force Approach:

The simplest way to find the maximum occurring character is through brute force. This approach involves iterating through each character in the string and maintaining a count of occurrences for each character. Finally, we identify the character with the maximum count. Let's outline the algorithm:

Algorithm:

1. Initialize an empty hash map to store character frequencies.
2. Iterate through each character in the string.
3. For each character, increment its corresponding count in the hash map.
4. After iterating through the entire string, find the character with the maximum count.
5. Return the character with the maximum count.

Now, let's implement this algorithm in various programming languages:

#include <stdio.h>
#include <string.h>

char maxOccurringCharacter(char str[]) {
int charCount[256] = {0};
char maxChar = '\0';
int maxCount = 0;

for (int i = 0; str[i] != '\0'; i++) {
char ch = str[i];
charCount[ch]++;
if (charCount[ch] > maxCount) {
maxChar = ch;
maxCount = charCount[ch];
}
}
return maxChar;
}

int main() {
char str[] = "hello";
printf("%c\n", maxOccurringCharacter(str));
return 0;
}


### Output

l
#include <iostream>
#include <unordered_map>
using namespace std;

char maxOccurringCharacter(string str) {
unordered_map<char, int> charCount;
char maxChar = '\0';
int maxCount = 0;

for (char ch : str) {
charCount[ch]++;
if (charCount[ch] > maxCount) {
maxChar = ch;
maxCount = charCount[ch];
}
}
return maxChar;
}

int main() {
string str = "hello";
cout << maxOccurringCharacter(str) << endl;
return 0;
}


### Output

l
<?php
function maxOccurringCharacter($str) {$charCount = [];
$maxChar = '';$maxCount = 0;

for ($i = 0;$i < strlen($str);$i++) {
$char =$str[$i]; if (!isset($charCount[$char])) {$charCount[$char] = 0; }$charCount[$char]++; if ($charCount[$char] >$maxCount) {
$maxChar =$char;
$maxCount =$charCount[$char]; } } return$maxChar;
}

// Example Usage:
$string = "hello"; echo maxOccurringCharacter($string);

?>

### Output

l
import java.util.HashMap;
import java.util.Map;

public class MaxOccurringCharacter {
public static char maxOccurringCharacter(String str) {
Map<Character, Integer> charCount = new HashMap<>();
char maxChar = '\0';
int maxCount = 0;

for (int i = 0; i < str.length(); i++) {
char ch = str.charAt(i);
charCount.put(ch, charCount.getOrDefault(ch, 0) + 1);
if (charCount.get(ch) > maxCount) {
maxChar = ch;
maxCount = charCount.get(ch);
}
}
return maxChar;
}

public static void main(String[] args) {
String str = "hello";
System.out.println(maxOccurringCharacter(str));
}
}


### Output

l
def max_occurring_character(s):
char_count = {}
max_char = ''
max_count = 0

for char in s:
char_count[char] = char_count.get(char, 0) + 1
if char_count[char] > max_count:
max_char = char
max_count = char_count[char]

return max_char

# Example Usage:
string = "hello"
print(max_occurring_character(string))


### Output

l

Conclusion:

In this article, we explored various techniques to find the maximum occurring character in a string. Starting with a brute force approach, we provided detailed algorithms and implementation examples in PHP, Java, C, C++, and Python. These solutions offer efficient methods to address this common programming task, empowering developers to handle string manipulation tasks effectively across different programming languages.