Commit 1ce4168

committed

Project euler problem 10 solution and test script

1 parent 9f24341 commit 1ce4168Copy full SHA for 1ce4168

File tree

+38

-0

lines changed

+38

-0

lines changed

Lines changed: 22 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,22 @@`
	`1`	`+// https://projecteuler.net/problem=10`
	`2`	`+`
	`3`	`+const isPrime = (number) => {`
	`4`	`+ let flag = true`
	`5`	`+ for (let j = number - 1; j >= 2; j--) {`
	`6`	`+ if (number % j === 0) {`
	`7`	`+ flag = false`
	`8`	`+ }`
	`9`	`+ }`
	`10`	`+ return flag`
	`11`	`+}`
	`12`	`+`
	`13`	`+const calculateSumOfPrimeNumbers = (maxNumber) => {`
	`14`	`+ let sum = 0`
	`15`	`+ for (let i = maxNumber - 1; i >= 2; i--) {`
	`16`	`+ if (isPrime(i) === true) {`
	`17`	`+ sum += i`
	`18`	`+ }`
	`19`	`+ }`
	`20`	`+ return sum`
	`21`	`+}`
	`22`	`+export { calculateSumOfPrimeNumbers }`

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,16 @@`
	`1`	`+import { calculateSumOfPrimeNumbers } from '../Problem10'`
	`2`	`+`
	`3`	`+describe('checkAnagram', () => {`
	`4`	`+ it('Return the sum of prime numbers upto but less than 14', () => {`
	`5`	`+ const SUT = calculateSumOfPrimeNumbers(14)`
	`6`	`+ expect(SUT).toBe(41)`
	`7`	`+ })`
	`8`	`+ it('Return the sum of prime numbers upto but less than 10', () => {`
	`9`	`+ const SUT = calculateSumOfPrimeNumbers(10)`
	`10`	`+ expect(SUT).toBe(17)`
	`11`	`+ })`
	`12`	`+ it('Return the sum of prime numbers upto but less than 100', () => {`
	`13`	`+ const SUT = calculateSumOfPrimeNumbers(100)`
	`14`	`+ expect(SUT).toBe(1060)`
	`15`	`+ })`
	`16`	`+})`

Comments

(0)