Unique Palindrome

CodeChefOpen on judge ↗

All submissions for this problem are available. Given a string of length N. Find the sum of the unique palindromic substring of string of size x and N-x in string. where 0 ≤ x ≤ N. Input - The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follow. - The first line of each test cases contain a string. - The second line con

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