Easy java solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int minimumSum(int num) {\n        \n        int nos[] = new int[4];\n\n        for(int i=0;i<4;i++){\n            nos[i]=num%10;\n            num/=10;\n        }\n\n        Arrays.sort(nos);\n        // System.out.print(nos[1]);\n        // int sol1=nos[0]*10 + nos[3] + nos[1]*10 + nos[2];\n        // int sol2=nos[1]*10 + nos[3] + nos[0]*10 + nos[2];\n        // return Math.min(sol1, sol2);\n\n        return Math.min(nos[0]*10 + nos[3] + nos[1]*10 + nos[2],nos[1]*10 + nos[3] + nos[0]*10 + nos[2] );\n    }\n}\n```
['Java']