We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent f9895a9 commit 7aa67dcCopy full SHA for 7aa67dc
src/hackerrank/interview_preparation_kit/greedy_algorithms/greedy_florist.js
@@ -3,7 +3,7 @@
3
* @see Solution Notes: [[docs/hackerrank/interview_preparation_kit/greedy_algorithms/greedy-florist-solution-notes.md]]
4
*/
5
6
-export function getMinimumCost(k, c) {
+function getMinimumCost(k, c) {
7
const flowers = c.map((x) => x).sort((a, b) => b - a);
8
9
let total = 0;
@@ -20,3 +20,4 @@ export function getMinimumCost(k, c) {
20
}
21
22
export default { getMinimumCost };
23
+export { getMinimumCost };
0 commit comments