add 2144

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      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||

src/main/java/com/fishercoder/solutions/_2144.java

@@ -0,0 +1,21 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _2144 {
+    public static class Solution1 {
+        public int minimumCost(int[] cost) {
+            Arrays.sort(cost);
+            int ans = 0;
+            for (int i = cost.length - 1; i >= 0; i--) {
+                ans += cost[i];
+                i--;
+                if (i >= 0) {
+                    ans += cost[i];
+                }
+                i--;
+            }
+            return ans;
+        }
+    }
+}

src/test/java/com/fishercoder/_2144Test.java

@@ -0,0 +1,40 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._2144;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _2144Test {
+    private static _2144.Solution1 solution1;
+    private static int[] cost;
+    private static int expected;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _2144.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        expected = 5;
+        cost = new int[]{1, 2, 3};
+        assertEquals(expected, solution1.minimumCost(cost));
+    }
+
+    @Test
+    public void test2() {
+        expected = 23;
+        cost = new int[]{6, 5, 7, 9, 2, 2};
+        assertEquals(expected, solution1.minimumCost(cost));
+    }
+
+    @Test
+    public void test3() {
+        expected = 10;
+        cost = new int[]{5, 5};
+        assertEquals(expected, solution1.minimumCost(cost));
+    }
+
+}