sum-of-primes-between-number-and-its-reverse

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer <code>n</code>.

Let <code>r</code> be the integer formed by reversing the digits of <code>n</code>.

Return the sum of all prime numbers between <code>min(n, r)</code> and <code>max(n, r)</code>, inclusive.

&nbsp;
Example 1:

<div class="example-block">
Input: n = 13

Output: 132

Explanation:

<ul>
	<li>The reverse of 13 is 31. Thus, the range is <code>[13, 31]</code>.</li>
	<li>The prime numbers in this range are 13, 17, 19, 23, 29, and 31.</li>
	<li>The sum of these prime numbers is <code>13 + 17 + 19 + 23 + 29 + 31 = 132</code>.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: n = 10

Output: 17

Explanation:

<ul>
	<li>The reverse of 10 is 1. Thus, the range is <code>[1, 10]</code>.</li>
	<li>The prime numbers in this range are 2, 3, 5, and 7.</li>
	<li>The sum of these prime numbers is <code>2 + 3 + 5 + 7 = 17</code>.</li>
</ul>
</div>

Example 3:

<div class="example-block">
Input: n = 8

Output: 0

Explanation:

<ul>
	<li>The reverse of 8 is 8. Thus, the range is <code>[8, 8]</code>.</li>
	<li>There are no prime numbers in this range, so the sum is 0.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 1000</code></li>
</ul>