[UPDATE] Change sieve algorithm implementation and now the solution

ddaniel27 · ddaniel27 · commit b94e5f9c6fd4 · 2022-10-24T00:09:51.000-05:00
works well. Also added some optimizations
diff --git a/Project-Euler/Problem035.js b/Project-Euler/Problem035.js
@@ -9,13 +9,13 @@
  *
  * @author ddaniel27
  */
-import { sieveOfEratosthenes } from '../Maths/SieveOfEratosthenes'
+import { sieveOfEratosthenes } from '../Maths/SieveOfEratosthenesIntArray'
 
 function problem35 (n) {
   if (n < 2) {
     throw new Error('Invalid input')
   }
-  const list = sieveOfEratosthenes(n)
+  const list = sieveOfEratosthenes(n).filter(prime => !prime.toString().match(/[024568]/)) // Get a list of primes without 0, 2, 4, 5, 6, 8
 
   const result = list.filter((number, _idx, arr) => {
     const str = String(number)
@@ -28,7 +28,7 @@ function problem35 (n) {
     return true // If all rotations are prime, then the number is circular prime
   })
 
-  return result.length 
+  return result.length + 1 // Add 2 to the result because 2 is a circular prime
 }
 
 export { problem35 }
