Prime Palindrome

CodeChefOpen on judge ↗

Problem Description Given a string, find the number of palindromic substrings of the string whose length is a prime number.The string consists only of lowercase english alphabet. These palindromes need not be distinct. Input The first line of the input contains an integer T denoting the number of test cases. Then, T lines follow. Each line contains a string. Note: N is the string length. Outp

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