add 2578

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -26,6 +26,7 @@
 | 2586 | [Count the Number of Vowel Strings in Range](https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range/)                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2586.java)                                       |                                      | Easy                           |
 | 2583 | [Kth Largest Sum in a Binary Tree](https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree/)                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2583.java)                                       |                                      | Medium                         |
 | 2582 | [Pass the Pillow](https://leetcode.com/problems/pass-the-pillow/)                                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2582.java)                                       |                                      | Easy                           |
+| 2578 | [Split With Minimum Sum](https://leetcode.com/problems/split-with-minimum-sum/)                                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2578.java)                                       |                                      | Easy                           |
 | 2566 | [Maximum Difference by Remapping a Digit](https://leetcode.com/problems/maximum-difference-by-remapping-a-digit/)                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2566.java)                                       |                                      | Easy                           |
 | 2562 | [Find the Array Concatenation Value](https://leetcode.com/problems/find-the-array-concatenation-value/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2562.java)                                       |                                      | Easy                           |
 | 2559 | [Count Vowel Strings in Ranges](https://leetcode.com/problems/count-vowel-strings-in-ranges/)                                                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2559.java)                                       |                                      | Medium                         |

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2578.java

@@ -0,0 +1,28 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+
+public class _2578 {
+    public static class Solution1 {
+        public int splitNum(int num) {
+            List<Integer> digits = new ArrayList<>();
+            while (num != 0) {
+                digits.add(num % 10);
+                num /= 10;
+            }
+            Collections.sort(digits);
+            StringBuilder nums1 = new StringBuilder();
+            StringBuilder nums2 = new StringBuilder();
+            for (int i = 0; i < digits.size(); i++) {
+                if (nums1.length() < nums2.length()) {
+                    nums1.append(digits.get(i));
+                } else {
+                    nums2.append(digits.get(i));
+                }
+            }
+            return Integer.parseInt(nums1.toString()) + Integer.parseInt(nums2.toString());
+        }
+    }
+}

Diff for: src/test/java/com/fishercoder/thirdthousand/_2578Test.java

@@ -0,0 +1,22 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2578;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _2578Test {
+    private static _2578.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2578.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(59, solution1.splitNum(4325));
+    }
+
+}