Given a positive integer num, split all of its digits into two integers num1 and num2 such that:

• The digits in num1 and num2 collectively form a permutation of the digits in num. In other words, every digit in num is assigned to either num1 or num2.

• The sum of num1 and num2 is minimized.

Return the minimum possible sum of num1 and num2.

Note: Both num1 and num2 can contain leading zeros.

Constraints:

• $10 \leq$ num $\leq 10^9$

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.