| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|2144|[Minimum Cost of Buying Candies With Discount](https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2144.java)||Easy||

|2139|[Minimum Moves to Reach Target Score](https://leetcode.com/problems/minimum-moves-to-reach-target-score/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2139.java)||Medium||

|2138|[Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2138.java)||Easy||

|2134|[Minimum Swaps to Group All 1's Together II](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2134.java)||Medium||

packagecom.fishercoder.solutions;

importjava.util.Arrays;

publicclass_2144 {

publicstaticclassSolution1 {

publicintminimumCost(int[]cost) {

Arrays.sort(cost);

intans =0;

for (inti =cost.length -1;i >=0;i--) {

ans +=cost[i];

i--;

if (i >=0) {

ans +=cost[i];

}

i--;

}

returnans;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._2144;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_2144Test {

privatestatic_2144.Solution1solution1;

privatestaticint[]cost;

privatestaticintexpected;

publicstaticvoidsetup() {

solution1 =new_2144.Solution1();

}

publicvoidtest1() {

expected =5;

cost =newint[]{1,2,3};

assertEquals(expected,solution1.minimumCost(cost));

}

publicvoidtest2() {

expected =23;

cost =newint[]{6,5,7,9,2,2};

assertEquals(expected,solution1.minimumCost(cost));

}

publicvoidtest3() {

expected =10;

cost =newint[]{5,5};

assertEquals(expected,solution1.minimumCost(cost));

}

}