[REFACTOR] [Hacker Rank] projecteuler exercises.

* standarized interface.

Author: Gonzalo Diaz

src/hackerrank/projecteuler/euler001.js

@@ -3,23 +3,26 @@
  */
 
 // Function to return gcd of a and b
-export function gcd(a, b) {
+function gcd(a, b) {
   if (a === 0) return b;
   return gcd(b % a, a);
 }
 
-export function sumAp(n, d) {
+function sumAp(n, d) {
   // Number of terms
   const _n = Math.floor(n / d);
 
   return Math.floor((_n * (1 + _n) * d) / 2);
 }
 
 // Function to find the sum of all multiples of a and b below n
-export function euler001(a, b, n) {
+function euler001(a, b, n) {
   // Since, we need the sum of multiples less than N
   const _n = n - 1;
   const lcm = Math.floor((a * b) / gcd(a, b));
 
   return sumAp(_n, a) + sumAp(_n, b) - sumAp(_n, lcm);
 }
+
+export default { euler001 };
+export { euler001 };

src/hackerrank/projecteuler/euler002.js

@@ -2,7 +2,7 @@
  * @link Problem definition [[docs/hackerrank/projecteuler/euler002.md]]
  */
 
-export function fiboEvenSum(n) {
+function fiboEvenSum(n) {
   let fibo1 = 1n;
   let fibo2 = 1n;
   let total = 0n;
@@ -20,8 +20,9 @@ export function fiboEvenSum(n) {
   return total;
 }
 
-export function euler002(n) {
+function euler002(n) {
   return fiboEvenSum(n);
 }
 
 export default { euler002 };
+export { euler002 };

src/hackerrank/projecteuler/euler003.js

@@ -4,7 +4,7 @@
 
 import { BigIntMath } from '../lib/BigIntMath.js';
 
-export function primeFactor(n) {
+function primeFactor(n) {
   if (n < 2) {
     throw new Error('n must be greater than 2');
   }
@@ -26,8 +26,9 @@ export function primeFactor(n) {
   return maxPrimeFactor;
 }
 
-export function euler003(n) {
+function euler003(n) {
   return primeFactor(BigInt(n));
 }
 
 export default { euler003 };
+export { euler003 };