You are given a positive integer num consisting of exactly $4$ digits.

Distribute all the digits of num into two new integers, new1 and new2. Each digit from num must be used exactly once across both integers.

Return the minimum possible sum of new1 and new2.

Note: Leading zeros are permitted in new1 and new2.

Constraints:

• $1000 \leq$ num $\leq 9999$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.