[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.ts

@@ -6,7 +6,7 @@
 const bigIntMax = (...args: bigint[]): bigint =>
   args.reduce((m, e) => (e > m ? e : m), BigInt(0));
 
-export function maxSubsetSum(arr: number[]): number {
+function maxSubsetSum(arr: number[]): number {
   const arrCopy: bigint[] = arr.map((x: number): bigint => BigInt(x));
 
   if (arrCopy.length === 0) {
@@ -32,3 +32,4 @@ export function maxSubsetSum(arr: number[]): number {
 }
 
 export default { maxSubsetSum };
+export { maxSubsetSum };