Counting

CodeChefOpen on judge ↗

Given a string $S$, count the number of non empty sub strings that are palindromes. A sub string is any continuous sequence of characters in the string. Two sub strings are different if they occur at different positions in S. ###Input: - Input contains only a single line that contains string $S$. ###Output: Print a single number, the number of sub strings that are palindromes. ###Constraints

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