ProString

CodeChefOpen on judge ↗

The $k^{th}$ ProString is: $P_k = P_{k−1}+c(k)+P_{k−1}$, where $c(k)$ is the $k_{th}$ lowercase character from the alphabet (example $c(5) = $'$e$'), and $P_0$ is empty string. For example, $P_4$="$abacabadabacaba$". Your task is for each given pair $k, i$, find $P_k[i]$. $P_k$ is $0$ indexed. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testc

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