Find original
CodeChefOpen on judge ↗
You are given a string $S_1$ which is made from combining all left cyclic rotations of another string $S_2$. Your task is to find the original string $S_2$. $ S_1$ = $d_0$ + $d_1$ + $d_2$ + .... + $d_{N-1}$, where $N$ is the length of $S_2$. $d_0$ is left rotation of $S_2$ by 0 elements, $d_1$ is left rotation of $S_2$ by 1 element, $d_2$ is left rotation of $S_2$ by 2 elements, and so on. ###
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