Palindrome Primes

CodeChefOpen on judge ↗

In mathematics, a **palindromic prime** also called a **palprime**, is a prime number that is also palindromic. Given a **non-negative** integer $N$, find out all the **palprimes** that can be formulated using the digits of $N$. For example, if $N$ = $233799$, the digits that can be used are $2, 3, 3, 7, 9, 9$. By using just, the digits of $N$, all the palprimes that can be produced

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