Check if a Number is an Emirp

Given an integer n, reverse its decimal digits. Return true when n is prime, its reversed value is a different number, and that reversed value is also prime.…

Given an integer `n`, reverse its decimal digits. Return `true` when `n` is prime, its reversed value is a different number, and that reversed value is also prime. Otherwise, return `false`.

- `2 ≤ n ≤ 10^6` - `n` is always a positive integer.

Example 1: input n = 13; output true. 13 and its distinct reverse 31 are both prime.

Example 2: input n = 11; output false. 11 is prime, but reversing it does not produce a different value.

Example 3: input n = 23; output false. The reverse 32 is not prime.

Category: Math. Topic: math. Difficulty: Easy. Patterns: math.