Simple Java Solution🔥 || 0ms runtime || Beats 100% 🔥
Stats\n- RunTime: 0ms (Beats 100%)\n\n# Code\n\npublic int minimumSum(int num) {\n    int digitsArr [] = new int[4], index = 0;\n\n    while (num != 0) {\n     
# Stats\n- **RunTime**: 0ms (Beats 100%)\n\n# Code\n```\npublic int minimumSum(int num) {\n    int digitsArr [] = new int[4], index = 0;\n\n    while (num != 0) {\n        digitsArr[index++] = num % 10;\n        num /= 10;\n    }\n\n    Arrays.sort(digitsArr);\n\n    return ((digitsArr[0] * 10 + digitsArr[3]) + (digitsArr[1] * 10 + digitsArr[2]));\n}\n\n```\n<br/>\n<br/>\n<br/>\n\nAuthor :- [*Abhinav Bhardwaj*](https://abhinavbhardwaj.in)
['Java']