[]BEATS 100%  || JAVA  || EASY FOR BEGGINERS
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{\n    public int minimumSum(int num)\n    {\n        int ind=0,num1,num2;\n        int arr[] = new int[4];\n        while(num!=0){\n            arr[ind]=num%10;\n            num=num/10;\n            ind++;\n        }\n        Arrays.sort(arr);\n        num1=arr[0]*10 +arr[2];\n        num2 = arr[1]*10 +arr[3];\n        return num1+num2;\n    }\n}\n```
['Java']