← All problemsSign in

Expected Repetitions

CodeChefRating 3155Open on judge ↗

You are given a string $S$ with length $N$ that contains only the $26$ lowercase English letters. You are also given a sequence $W_1, W_2, \ldots, W_{26}$ of weights corresponding to these letters in the order from 'a' to 'z', i.e. $W_1$ is the weight of 'a', $W_2$ is the weight of 'b' and so on. We define the *weight* of a string as the sum of weights of all characters present in it. If a char

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

Sign in to chat with the tutor and save your progress.

Sign in to start