From 4afd13489ae37f6ad083744dfd76722ca7662c07 Mon Sep 17 00:00:00 2001
From: Jeremy L Thompson <jeremy@jeremylt.org>
Date: Thu, 16 Jun 2022 07:15:23 -0600
Subject: [PATCH] fix(curriculum): slighly faster solution for euler47 (#46487)

euler47 - slighly faster soln
---
 .../project-euler/problem-47-distinct-primes-factors.md       | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
index 71f35851404..b6fb1f6c1da 100644
--- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
+++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
@@ -68,13 +68,13 @@ distinctPrimeFactors(4, 4);
 
 ```js
 // Initalize factor count with seive
-const NUMFACTORS = Array(150000).fill(0);
+const NUMFACTORS = Array(135000).fill(0);
 (function initFactors(num) {
   for (let i = 2; i < num; i++)
     if (NUMFACTORS[i] === 0)
       for (let j = i; j < num; j += i)
         NUMFACTORS[j]++;
-})(150000);
+})(135000);
 
 function distinctPrimeFactors(targetNumPrimes, targetConsecutive) {
   let numConsecutive = 0;