prime-palindrome

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an integer n, return the smallest prime palindrome greater than or equal to <code>n</code>.

An integer is prime if it has exactly two divisors: <code>1</code> and itself. Note that <code>1</code> is not a prime number.

<ul>
	<li>For example, <code>2</code>, <code>3</code>, <code>5</code>, <code>7</code>, <code>11</code>, and <code>13</code> are all primes.</li>
</ul>

An integer is a palindrome if it reads the same from left to right as it does from right to left.

<ul>
	<li>For example, <code>101</code> and <code>12321</code> are palindromes.</li>
</ul>

The test cases are generated so that the answer always exists and is in the range <code>[2, 2 * 108]</code>.

&nbsp;
Example 1:
<pre>Input: n = 6
Output: 7
</pre>Example 2:
<pre>Input: n = 8
Output: 11
</pre>Example 3:
<pre>Input: n = 13
Output: 101
</pre>
&nbsp;
Constraints:

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

Weekly Contest 92

weekly-contest-92

primePalindrome

Principal

Prime Palindrome

Math

Number Theory

Primality Test

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs