| # | 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|

packagecom.fishercoder.solutions;

publicclass_1774 {

publicstaticclassSolution1 {

intresult =0;

publicintclosestCost(int[]baseCosts,int[]toppingCosts,inttarget) {

result =baseCosts[0];

for (inti =0;i <baseCosts.length;i++) {

recursion(baseCosts[i],toppingCosts,0,target);

}

returnresult;

}

privatevoidrecursion(intcurrentCost,int[]toppingCosts,intindex,inttarget) {

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);

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1774;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_1774Test {

privatestatic_1774.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1774.Solution1();

}

publicvoidtest1() {

assertEquals(10,solution1.closestCost(newint[]{1,7},newint[]{3,4},10));

}

publicvoidtest2() {

assertEquals(17,solution1.closestCost(newint[]{2,3},newint[]{4,5,100},18));

}

publicvoidtest3() {

assertEquals(8,solution1.closestCost(newint[]{3,10},newint[]{2,5},9));

}

}