✅ Easy approach ✅
TC: O(nlogn)\nSC: O(1)\n\nclass Solution {\npublic:\n    int minimumSum(int num) {\n        vector<int> v;\n        while(num > 0) {\n            int digit = nu
$$TC: O(nlogn)$$\n$$SC: O(1)$$\n```\nclass Solution {\npublic:\n    int minimumSum(int num) {\n        vector<int> v;\n        while(num > 0) {\n            int digit = num % 10;\n            v.push_back(digit);\n            num /= 10;\n        }\n        sort(v.begin(), v.end());\n        return (v[0] * 10 + v[3]) + (v[1] * 10 + v[2]);\n    }\n};\n```
['Sorting', 'C++']