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

* Adjusted the interface to match what hackerrank expects.

Author: sir-gon

src/hackerrank/interview_preparation_kit/greedy_algorithms/greedy_florist.js

@@ -3,7 +3,7 @@
  * @see Solution Notes: [[docs/hackerrank/interview_preparation_kit/greedy_algorithms/greedy-florist-solution-notes.md]]
  */
 
-export function getMinimumCost(k, c) {
+function getMinimumCost(k, c) {
   const flowers = c.map((x) => x).sort((a, b) => b - a);
 
   let total = 0;

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

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