Double Substrings
CodeChefOpen on judge ↗
A string is called a "Double" if it is of the form $X+X$ for some non-empty string $X$ where $+$ denotes the string concatenation operator. You are given a string $S$ and $Q$ queries of the form $[L, R]$. For each query, you need to calculate the sum of the lengths of all "Double" strings which are contained entirely within the range $[L, R]$, i.e. only consider substrings $[l, r]$ which
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