Wonderful Strings

CodeChefOpen on judge ↗

Problem Statement Chef has bought T strings to gift his friend Jay. Later he realized that Jay only likes those strings which are wonderful. A string is wonderful only if all the characters in that string are repeated the same number of times. Chef can change any letter of the string to any other letter, but it costs one coin for him to do so. Now he wants to know the minimum number of coins requ

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI