You are given a positive integer n. Each digit of n is assigned a sign that alternates between positive and negative:

• The most significant digit is assigned a positive sign.

• Each subsequent digit is assigned a sign opposite to the digit preceding it.

Return the sum of all digits with their corresponding signs applied.

Constraints:

• $1 \leq$ n $\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.