Python Program to Find Most Frequent Character in String

You can find the most frequent character in a string using max(string, key=string.count) which returns the character that appears the most times.

Examples

Inputhello

Outputl

Inputmississippi

Outputi

Inputaabbcc

Outputa

How to Think About It

To find the most frequent character, count how many times each character appears in the string. Then, find the character with the highest count. If multiple characters have the same highest count, the first one found is returned.

Algorithm

1

Get the input string.

2

Count the occurrences of each character in the string.

3

Find the character with the maximum count.

4

Return that character as the most frequent.

Code

python

def most_frequent_char(s):
    return max(s, key=s.count)

input_str = "mississippi"
print(most_frequent_char(input_str))

Output

i

Dry Run

Let's trace the string 'mississippi' through the code.

1

Input string

s = 'mississippi'

2

Count characters

Counts: m=1, i=4, s=4, p=2

3

Find max count character

Characters with max count 4 are 'i' and 's', max returns first found 'i'

4

Return result

Return 'i'

Character	Count
m	1
i	4
s	4
p	2

Why This Works

Step 1: Counting characters

The count method counts how many times each character appears in the string.

Step 2: Finding maximum

The max function with key=s.count finds the character with the highest count.

Step 3: Returning result

The character with the highest frequency is returned as the most frequent character.

Alternative Approaches

Using collections.Counter

python

from collections import Counter

def most_frequent_char(s):
    counts = Counter(s)
    return counts.most_common(1)[0][0]

input_str = "mississippi"
print(most_frequent_char(input_str))

This method is efficient and clear, using a built-in class designed for counting.

Using dictionary to count manually

python

def most_frequent_char(s):
    counts = {}
    for char in s:
        counts[char] = counts.get(char, 0) + 1
    max_char = max(counts, key=counts.get)
    return max_char

input_str = "mississippi"
print(most_frequent_char(input_str))

This approach shows how to count characters manually without extra imports.

Complexity: O(n^2) time, O(n) space

Time Complexity

Using max(s, key=s.count) calls count for each character, which scans the string each time, leading to O(n^2) time for string length n.

Space Complexity

The method uses O(1) extra space if counting on the fly, but storing counts in a dictionary or Counter uses O(n) space.

Which Approach is Fastest?

Using collections.Counter is faster with O(n) time because it counts all characters in one pass.

Approach	Time	Space	Best For
max with s.count	O(n^2)	O(1)	Short strings, simple code
collections.Counter	O(n)	O(n)	Long strings, efficient counting
Manual dictionary count	O(n)	O(n)	Learning counting logic, no imports