Time: 0 ms (100%), Space: 7.3 MB (46.4%) - LeetHub

Author: shahdhoss

2650-split-with-minimum-sum/2650-split-with-minimum-sum.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    int splitNum(int num) {
+        int keyone = 0, keytwo = 0;
+        string key1 = "", key2 = "", number;
+        number = to_string(num);
+        sort(number.begin(), number.end());
+        for (int i = 0; i < number.length(); i++) {
+            if (i % 2 == 0) {
+                key1 = key1 + number[i];
+            } else {
+                key2 = key2 + number[i];
+            }
+        }
+        keyone = stoi(key1);
+        keytwo = stoi(key2);
+        return keyone + keytwo;
+    }
+};