Palindromic Trees

CodeChefOpen on judge ↗

You are given String $S$. Find out total no. of substrings which are Palindromes and also find out the total no. of Distinct Palindromes available. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, 1 String $S$. ###Output: For each testcase, output two integers space separated in a single line $N$ $M$ i

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