Prime Palindrome Sum

CodeChefOpen on judge ↗

An integer is said to be prime palindrome if it is a prime number and its reverse is same as that of the original number. Your task is to output the sum of all such prime palindromes lies between the range N and M (N and M both are inclusive). Input description. - The first line of input contains an integer Tdenoting the number of test cases. - The Second line contains two integers N and M

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