C++ 1-liner Easy & Simple Solution Ever
Approach\n Describe your approach to solving the problem. \nFirst off all we will split num 2932 into 2,9,3,2 and we will store them in vector a.\nThen we sort 
# Approach\n<!-- Describe your approach to solving the problem. -->\nFirst off all we will split num 2932 into 2,9,3,2 and we will store them in vector a.\nThen we sort a , --------------> 2 , 2 , 3 , 9 .\nnow, the min sum possible is 22 + 29 .\n23 means 2*10+3 -----------------> a[0]*10 + a[2];\n29 means 2*10+9 -----------------> a[1]*10 + a[3];\n\nso we will return a[0]*10 + a[1]*10 + a[2] + a[3] \n\n# Code\n```\nclass Solution {\npublic:\n    int minimumSum(int num) {\n        vector<int>a(4);\n        for(int i=0;i<a.size();i++){\n            a[i] = num%10;\n            num = num/10;  // splitting number into digits & pushing into vector a \n        }\n        sort(a.begin(),a.end());\n        return (a[0]+a[1])*10 + a[2]+a[3]; \n    }\n};\n```
['C++']