📦 NEW: Project Euler Problem 5 improvement and added test cases

Author: omkarnathparida

Diff for: Project-Euler/Problem005.js

@@ -5,11 +5,12 @@ 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) => {
+  if (isNaN(maxDivisor)) {
+    return 0
+  }
+  const divisors = Array.from({ length: maxDivisor }, (_, i) => i + 1)
+  let num = maxDivisor + 1
   let result
 
   while (!result) {

Diff for: Project-Euler/test/Problem005.test.js

@@ -0,0 +1,14 @@
+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)
+  })
+})