2264. Minimum Sum of Four Digit Number After Splitting Digits
My accepted C++ solution to LeetCode problem 2264, Minimum Sum of Four Digit Number After Splitting Digits, running in 0ms.
- Difficulty: Easy
- C++
- Runtime 0ms
- Memory 8.1MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
C++
Accepted on LeetCode — runtime 0ms, memory 8.1MB, accepted 2025-12-27.
class Solution {
public:
int minimumSum(int num) {
vector<int> digits;
while (num > 0) {
digits.push_back(num % 10);
num /= 10;
}
sort(digits.begin(), digits.end());
return (digits[0] * 10 + digits[2]) + (digits[1] * 10 + digits[3]);
}
};