You are given an integer n.

Let rev be the integer obtained by reversing the decimal digits of n. Define the range as $[\min(`n`, `rev`), \max(`n`, `rev`)]$.

Return the sum of all prime numbers located within this inclusive range. If there are no prime numbers in the range, return $0$.

Constraints:

• $1 \leq$ n $\leq 1000$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.