← All problemsSign in

Play with strings

Gennady likes strings very much. He likes to solve most problems involving strings. So this problem contains strings and strings only. You will be given a string S with lower-case alphabets only. You have to count the number of substrings which start and end at the same character and has an odd length. Input First line contains a positive integer T denoting the number of test cases. For each t

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

Sign in to chat with the tutor and save your progress.

Sign in to start