solves #2587: Split With Minimum Sum in java

Author: anishLearnsToCode

README.md

@@ -804,7 +804,7 @@
 | 2566 | [Maximum Difference by Remapping a Digit](https://leetcode.com/problems/maximum-difference-by-remapping-a-digit)                                                       |                                                                             [![Java](assets/java.png)](src/MaximumDifferenceByRemappingADigit.java)                                                                              |                                                                                                                                   |
 | 2570 | [Merge Two 2D Arrays by Summing Values](https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values)                                                           |                                                                               [![Java](assets/java.png)](src/MergeTwo2DArraysBySummingValues.java)                                                                               |                                                                                                                                   |
 | 2574 | [Left and Right Sum Differences](https://leetcode.com/problems/left-and-right-sum-differences)                                                                         |                                                                                 [![Java](assets/java.png)](src/LeftAndRightSumDifferences.java)                                                                                  |                                                                                                                                   |
-| 2578 | [Split With Minimum Sum](https://leetcode.com/problems/split-with-minimum-sum)                                                                                         |                                                                                                                                                                                                                                  |                                                                                                                                   |
+| 2578 | [Split With Minimum Sum](https://leetcode.com/problems/split-with-minimum-sum)                                                                                         |                                                                                     [![Java](assets/java.png)](src/SplitWithMinimumSum.java)                                                                                     |                                                                                                                                   |
 | 2582 | [Pass the Pillow](https://leetcode.com/problems/pass-the-pillow)                                                                                                       |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2586 | [Count the Number of Vowel Strings in Range](https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range)                                                 |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2591 | [Distribute Money to Maximum Children](https://leetcode.com/problems/distribute-money-to-maximum-children)                                                             |                                                                                                                                                                                                                                  |                                                                                                                                   |

src/SplitWithMinimumSum.java

@@ -0,0 +1,32 @@
+// https://leetcode.com/problems/split-with-minimum-sum
+// T: O(log(N)log(log(N)))
+// S: O(log(log(N)))
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class SplitWithMinimumSum {
+    public int splitNum(int num) {
+        final List<Integer> digits = getDigits(num);
+        digits.sort(Integer::compareTo);
+        int a = 0, b = 0, k = 0;
+        for (int digit : digits) {
+            if (k == 0) {
+                a = 10 * a + digit;
+            } else {
+                b = 10 * b + digit;
+            }
+            k ^= 1;
+        }
+        return a + b;
+    }
+
+    private List<Integer> getDigits(int x) {
+        final List<Integer> digits = new ArrayList<>();
+        final String number = x + "";
+        for (int index = 0 ; index < number.length() ; index++) {
+            digits.add(number.charAt(index) - '0');
+        }
+        return digits;
+    }
+}