[REFACTOR] [Hacker Rank] Interview Preparation Kit: Greedy Algorithms: Max Min.

* Adjusted the interface to match what hackerrank expects.

Author: sir-gon

src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.js

@@ -2,7 +2,7 @@
  * @link Problem definition [[docs/hackerrank/interview_preparation_kit/greedy_algorithms/angry-children.md]]
  */
 
-export function maxMin(k, arr) {
+function maxMin(k, arr) {
   const sortedlist = arr.map((x) => x).sort((a, b) => a - b);
 
   let result = sortedlist[sortedlist.length - 1] - sortedlist[0];

src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.test.js

@@ -1,7 +1,7 @@
 import { describe, expect, it } from '@jest/globals';
 import { logger as console } from '../../../logger.js';
 
-import { maxMin } from './angry_children.js';
+import angryChildren from './angry_children.js';
 
 import TEST_CASES from './angry_children.testcases.json';
 
@@ -10,7 +10,7 @@ describe('angry_children', () => {
     expect.assertions(4);
 
     TEST_CASES.forEach((test) => {
-      const answer = maxMin(test.k, test.arr);
+      const answer = angryChildren.maxMin(test.k, test.arr);
 
       console.debug(`maxMin(${test.k}, ${test.arr}) solution found: ${answer}`);