We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 47513c8 commit cddd0cbCopy full SHA for cddd0cb
866-prime-palindrome.js
@@ -1,3 +1,28 @@
1
+/**
2
+ * @param {number} n
3
+ * @return {number}
4
+ */
5
+const primePalindrome = function(n) {
6
+ if(n >= 8 && n <= 11) return 11
7
+ const rev = str => str.split('').reverse().join('')
8
+ for (let i = 1; i < 1e5; i++) {
9
+ let left = `${i}`, right = rev(left).slice(1)
10
+ let num = +(left + right)
11
+ if (num >= n && isPrime(num)) return num
12
+ }
13
+ return -1
14
+
15
+ function isPrime(num) {
16
+ if(num < 2 || num % 2 === 0) return num === 2
17
+ for(let i = 3; i * i <= num; i += 2) {
18
+ if(num % i === 0) return false
19
20
+ return true
21
22
+};
23
24
+// another
25
26
/**
27
* @param {number} N
28
* @return {number}
0 commit comments