Shroud and string operations
CodeChefOpen on judge ↗
Shroud's friend is a very good programmer. He gave shroud a problem to solve, in the problem you are given a string $S$ and $N$ operations have been performed on the string. Shroud needs your help to find the original string. The operation is as follows : - Assuming 1-based indexing $i$'th character from the end will be inserted between $i$'th and $i+1$'th index from the start. The string contain
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