Character frequency

CodeChefOpen on judge ↗

You are given a string $S$ containing only small letters alphabets. You are also given an integer $Q$, denoting the number of queries. For each query you are given an integer $i$ (1<=i<=N) denoting the $ith$ position character in the string $S$. You have to find the character present at index $i$ and print the frequency of the same character preceding the given $i$ position. ### Input The first

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