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 d1c8f76 commit 6e33cabCopy full SHA for 6e33cab
866-prime-palindrome.js
@@ -44,3 +44,30 @@ function isPrime(x) {
44
}
45
return true
46
47
+
48
+// another
49
50
51
+/**
52
+ * @param {number} n
53
+ * @return {number}
54
+ */
55
+const primePalindrome = function(n) {
56
+ if(n >= 8 && n <= 11) return 11
57
58
+ const rev = num => `${num}`.split('').reverse().join('')
59
+ for(let i = 1; i < 1e5; i++) {
60
+ let left = i, right = rev(left).slice(1)
61
+ const tmp = +(left + right)
62
+ if(tmp >= n && isPrime(tmp)) return tmp
63
+ }
64
65
+ function isPrime(num) {
66
+ if(num <= 2) return num === 2
67
+ if(num % 2 === 0) return false
68
+ for(let i = 3; i ** 2 <= num; i += 2) {
69
+ if(num % i === 0) return false
70
71
+ return true
72
73
+};
0 commit comments