Skip to content

Practice Minimum Operations to Make Character Frequencies Equal

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#3389
LeetCode Problem

Minimum Operations to Make Character Frequencies Equal

Problem Statement

A string is good when all characters present have equal frequencies. One operation may delete a character, insert a character, or advance a character to the next alphabet letter. Advancing z to a is not allowed. Return the minimum number of operations to make s good.

Source: Minimum Operations to Make Character Frequencies Equal on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "acab"
Output
1

# Example 2

Input
s = "wddw"
Output
0

# Example 3

Input
s = "aaabc"
Output
2

Constraints

3 <= s.length <= 2 * 10^4
s contains only lowercase English letters.

Related LeetCode Problems

Practice more problems similar to Minimum Operations to Make Character Frequencies Equal.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.