Merge pull request #491 from sir-gon/develop

[Hacker Rank]: Project Euler #3: Largest prime factor. Optimized.

Author: sir-gon

src/hackerrank/projecteuler/euler003.ts

@@ -11,24 +11,18 @@ export function primeFactor(n: bigint): bigint {
 
   let divisor: bigint = n;
   let maxPrimeFactor: bigint = divisor;
-  let mpfInitialized = false;
 
   let i = 2n;
 
   while (i <= BigIntMath.sqrt(divisor)) {
     if (divisor % i === 0n) {
       divisor /= i;
       maxPrimeFactor = divisor;
-      mpfInitialized = true;
     } else {
       i += 1n;
     }
   }
 
-  if (!mpfInitialized) {
-    return n;
-  }
-
   return maxPrimeFactor;
 }