[REFACTOR] [Hacker Rank] Interview Preparation Kit: Dynamic Programming: Max Array Sum. Adjusted the interface to match what hackerrank expects.

Author: sir-gon

src/hackerrank/interview_preparation_kit/dynamic_programming/max_array_sum.js

@@ -6,7 +6,7 @@
 const bigIntMax = (...args) =>
   args.reduce((m, e) => (e > m ? e : m), BigInt(0));
 
-export function maxSubsetSum(arr) {
+function maxSubsetSum(arr) {
   const arrCopy = arr.map((x) => BigInt(x));
 
   if (arrCopy.length === 0) {

src/hackerrank/interview_preparation_kit/dynamic_programming/max_array_sum.test.js

@@ -1,7 +1,7 @@
 import { describe, expect, it } from '@jest/globals';
 import { logger as console } from '../../../logger.js';
 
-import { maxSubsetSum } from './max_array_sum.js';
+import maxArraySum from './max_array_sum.js';
 
 import TEST_CASES from './max_array_sum.testcases.json';
 import TEST_CASE3 from './max_array_sum.testcase3.json';
@@ -15,7 +15,9 @@ describe('max_array_sum', () => {
     expect.assertions(4);
 
     ALL_TEST_CASES.forEach((test) => {
-      const answer = maxSubsetSum(test.input).toString(DECIMAL_RADIX);
+      const answer = maxArraySum
+        .maxSubsetSum(test.input)
+        .toString(DECIMAL_RADIX);
 
       console.debug(`maxSubsetSum(${test.input}) solution found: ${answer}`);
 
@@ -29,7 +31,7 @@ describe('max_array_sum', () => {
     const input = [];
     const expected = 0;
 
-    const answer = maxSubsetSum(input);
+    const answer = maxArraySum.maxSubsetSum(input);
 
     console.debug(`maxSubsetSum(${input}) solution found: ${answer}`);
 
@@ -42,7 +44,7 @@ describe('max_array_sum', () => {
     const input = [1];
     const expected = 1;
 
-    const answer = maxSubsetSum(input);
+    const answer = maxArraySum.maxSubsetSum(input);
 
     console.debug(`maxSubsetSum(${input}) solution found: ${answer}`);