You are given an integer num. Rearrange the digits of num such that its numerical value is minimized.

The rearranged integer must not contain any leading zeros, unless num itself is equal to $0$.

Return the rearranged integer with the smallest value.

Constraints:

• $-10^{15} \leq$ num $\leq 10^{15}$

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.