Commit ff314a2

authored

Add tests for Project Euler Problem 5 + minor refactor (TheAlgorithms#1691)

1 parent 18da83a commit ff314a2Copy full SHA for ff314a2

File tree

+18

-5

lines changed

+18

-5

lines changed

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -35,6 +35,8 @@`
`35`	`35`	`* [ROT13](Ciphers/ROT13.js)`
`36`	`36`	`* [VigenereCipher](Ciphers/VigenereCipher.js)`
`37`	`37`	`* [XORCipher](Ciphers/XORCipher.js)`
	`38`	`+* Compression`
	`39`	`+ * [RLE](Compression/RLE.js)`
`38`	`40`	`* Conversions`
`39`	`41`	`* [ArbitraryBase](Conversions/ArbitraryBase.js)`
`40`	`42`	`* [ArrayBufferToBase64](Conversions/ArrayBufferToBase64.js)`
`@@ -285,6 +287,7 @@`
`285`	`287`	`* [Problem016](Project-Euler/Problem016.js)`
`286`	`288`	`* [Problem017](Project-Euler/Problem017.js)`
`287`	`289`	`* [Problem018](Project-Euler/Problem018.js)`
	`290`	`+ * [Problem019](Project-Euler/Problem019.js)`
`288`	`291`	`* [Problem020](Project-Euler/Problem020.js)`
`289`	`292`	`* [Problem021](Project-Euler/Problem021.js)`
`290`	`293`	`* [Problem023](Project-Euler/Problem023.js)`

Lines changed: 3 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,11 +5,9 @@ Smallest multiple`
`5`	`5`	`What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?`
`6`	`6`	`*/`
`7`	`7`
`8`		`-export const findSmallestMultiple = () => {`
`9`		`- const divisors = [`
`10`		`- 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2`
`11`		`- ]`
`12`		`- let num = 21`
	`8`	`+export const findSmallestMultiple = (maxDivisor) => {`
	`9`	`+ const divisors = Array.from({ length: maxDivisor }, (_, i) => i + 1)`
	`10`	`+ let num = maxDivisor + 1`
`13`	`11`	`let result`
`14`	`12`
`15`	`13`	`while (!result) {`

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,12 @@`
	`1`	`+import { expect } from 'vitest'`
	`2`	`+import { findSmallestMultiple } from '../Problem005.js'`
	`3`	`+`
	`4`	`+describe.concurrent('Find smallest multiple', () => {`
	`5`	`+ test.each([`
	`6`	`+ [10, 2520],`
	`7`	`+ [15, 360360],`
	`8`	`+ [20, 232792560]`
	`9`	`+ ])('max divisor -> %i, smallest multiple -> %i', (a, expected) => {`
	`10`	`+ expect(findSmallestMultiple(a)).toBe(expected)`
	`11`	`+ })`
	`12`	`+})`

Comments

(0)