Get change

Author: edignot

src/change-making/change-making.js

@@ -0,0 +1,17 @@
+// Problem: Return minimum amount fo coins that add up to a given amount of money
+// Time complexity:
+
+const getChange = (cents) => {
+    const change = {};
+    const coins = [100, 50, 20, 10, 5, 2, 1];
+    coins.forEach((coin) => {
+        if (cents >= coin) {
+            const numOfCoins = Math.floor(cents / coin);
+            change[coin] = numOfCoins;
+            cents -= coin * numOfCoins;
+        }
+    });
+    return change;
+};
+
+export default getChange;

src/change-making/change-making.test.js

@@ -0,0 +1,13 @@
+import getChange from "./change-making";
+
+describe("Get change", () => {
+    test("Get change", () => {
+        expect(getChange(5)).toStrictEqual({ 5: 1 });
+    });
+    test("Get change", () => {
+        expect(getChange(123)).toStrictEqual({ 1: 1, 100: 1, 2: 1, 20: 1 });
+    });
+    test("Get change", () => {
+        expect(getChange(17)).toStrictEqual({ 10: 1, 2: 1, 5: 1 });
+    });
+});

src/kanpsack/knapsack.js

@@ -1,14 +1,5 @@
 // Problem: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible
 // Time complexity:
-
-const items = [
-    { id: "a", weight: 8, value: 7 },
-    { id: "b", weight: 4, value: 5 },
-    { id: "c", weight: 2, value: 3 },
-    { id: "d", weight: 7, value: 5 },
-];
-const maxWeight = 11;
-
 const getBag = (items, maxWeight, itemIndex) => {
     if (maxWeight === 0 || itemIndex < 0) {
         return {
@@ -47,3 +38,6 @@ const getBag = (items, maxWeight, itemIndex) => {
 };
 
 export default getBag;
+
+// 0-1 Knapsack problem:
+