Alan Challenges Christopher
CodeChefOpen on judge ↗
Alan and Christopher are playing a game. There is a string $S$ of length $N$. Alan gives two integers $L$ and $R$ to Christopher. Consider the substring from $Lth$ to $Rth$ character of $S$. (Both inclusive) Christopher is supposed to reconstruct this substring using the characters in $S$, except he is not allowed to pick them from the positions $L$ to $R$. (Both inclusive) Note that
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.
Sign in to chat with the tutor and save your progress.
Sign in to start