Add tests for Project Euler Problem 5 + minor refactor

DIRECTORY.md

@@ -35,6 +35,8 @@
  * [ROT13](Ciphers/ROT13.js)
  * [VigenereCipher](Ciphers/VigenereCipher.js)
  * [XORCipher](Ciphers/XORCipher.js)
+* **Compression**
+ * [RLE](Compression/RLE.js)
 * **Conversions**
  * [ArbitraryBase](Conversions/ArbitraryBase.js)
  * [ArrayBufferToBase64](Conversions/ArrayBufferToBase64.js)
@@ -285,6 +287,7 @@
  * [Problem016](Project-Euler/Problem016.js)
  * [Problem017](Project-Euler/Problem017.js)
  * [Problem018](Project-Euler/Problem018.js)
+ * [Problem019](Project-Euler/Problem019.js)
  * [Problem020](Project-Euler/Problem020.js)
  * [Problem021](Project-Euler/Problem021.js)
  * [Problem023](Project-Euler/Problem023.js)

Project-Euler/Problem005.js

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

Project-Euler/test/Problem005.test.js

@@ -0,0 +1,15 @@
+import { findSmallestMultiple } from '../Problem005.js'
+
+describe.concurrent('Find smallest multiple', () => {
+ test('if max divisor is 10', () => {
+ expect(findSmallestMultiple(10)).toBe(2520)
+ })
+ test('if max divisor is 15', () => {
+ expect(findSmallestMultiple(15)).toBe(360360)
+ })
+
+ // Project Euler Condition Check
+ test('if max divisor is 20', () => {
+ expect(findSmallestMultiple(20)).toBe(232792560)
+ })
+})