Commitb94e5f9

committed

[UPDATE] Change sieve algorithm implementation and now the solution

works well. Also added some optimizations

1 parente88994f commitb94e5f9Copy full SHA for b94e5f9

File tree

-3

lines changed

-3

lines changed

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -9,13 +9,13 @@`
`9`	`9`	`*`
`10`	`10`	`*@author ddaniel27`
`11`	`11`	`*/`
`12`		`-import{sieveOfEratosthenes}from'../Maths/SieveOfEratosthenes'`
	`12`	`+import{sieveOfEratosthenes}from'../Maths/SieveOfEratosthenesIntArray'`
`13`	`13`
`14`	`14`	`functionproblem35(n){`
`15`	`15`	`if(n<2){`
`16`	`16`	`thrownewError('Invalid input')`
`17`	`17`	`}`
`18`		`-constlist=sieveOfEratosthenes(n)`
	`18`	`+constlist=sieveOfEratosthenes(n).filter(prime=>!prime.toString().match(/[024568]/))// Get a list of primes without 0, 2, 4, 5, 6, 8`
`19`	`19`
`20`	`20`	`constresult=list.filter((number,_idx,arr)=>{`
`21`	`21`	`conststr=String(number)`
`@@ -28,7 +28,7 @@ function problem35 (n) {`
`28`	`28`	`returntrue// If all rotations are prime, then the number is circular prime`
`29`	`29`	`})`
`30`	`30`
`31`		`-returnresult.length`
	`31`	`+returnresult.length+1// Add 2 to the result because 2 is a circular prime`
`32`	`32`	`}`
`33`	`33`
`34`	`34`	`export{problem35}`

Comments

(0)