vishnucoder1
diff --git a/‎README.md
Lines changed: 1 addition & 0 deletions b/‎README.md
Lines changed: 1 addition & 0 deletions
diff --git a/‎src/main/java/com/fishercoder/solutions/_1774.java
Lines changed: 27 additions & 0 deletions b/‎src/main/java/com/fishercoder/solutions/_1774.java
Lines changed: 27 additions & 0 deletions
diff --git a/‎src/test/java/com/fishercoder/_1774Test.java
Lines changed: 32 additions & 0 deletions b/‎src/test/java/com/fishercoder/_1774Test.java
Lines changed: 32 additions & 0 deletions
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1774|[Closest Dessert Cost](https://leetcode.com/problems/closest-dessert-cost/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1774.java) ||Medium|Greedy|
 |1773|[Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1773.java) ||Easy|Array, String|
 |1769|[Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1769.java) ||Medium|Array, Greedy|
 |1768|[Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1768.java) ||Easy|String|
 
@@ -0,0 +1,27 @@
+package com.fishercoder.solutions;
+
+public class _1774 {
+    public static class Solution1 {
+        int result = 0;
+
+        public int closestCost(int[] baseCosts, int[] toppingCosts, int target) {
+            result = baseCosts[0];
+            for (int i = 0; i < baseCosts.length; i++) {
+                recursion(baseCosts[i], toppingCosts, 0, target);
+            }
+            return result;
+        }
+
+        private void recursion(int currentCost, int[] toppingCosts, int index, int target) {
+            if (Math.abs(currentCost - target) < Math.abs(result - target) || (Math.abs(currentCost - target) < Math.abs(result - target) && currentCost == result)) {
+                result = currentCost;
+            }
+            if (index == toppingCosts.length || currentCost == target) {
+                return;
+            }
+            recursion(currentCost, toppingCosts, index + 1, target);
+            recursion(currentCost + toppingCosts[index], toppingCosts, index + 1, target);
+            recursion(currentCost + toppingCosts[index] * 2, toppingCosts, index + 1, target);
+        }
+    }
+}
@@ -0,0 +1,32 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1774;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1774Test {
+    private static _1774.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1774.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(10, solution1.closestCost(new int[]{1, 7}, new int[]{3, 4}, 10));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(17, solution1.closestCost(new int[]{2, 3}, new int[]{4, 5, 100}, 18));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(8, solution1.closestCost(new int[]{3, 10}, new int[]{2, 5}, 9));
+    }
+
+}