SPECIAL ORDERINGS

CodeChefOpen on judge ↗

Special Orderings of a string $S$ with length $|S|$ is a sequence of $|S|$ integers, where $i-th$ number is the total number of non-empty sub-strings of $S$ which are $i$-ordered. A string is $1$-ordered if and only if it reads the same backward as forward. A string is $i$-ordered ( $i$ > 1) if and only if: $ 1 : $ Its left half equals to its right half. $ 2 : $ Its left and right halves a

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