You are given an array of positive integers nums.

The element sum is the sum of all elements in nums.
The digit sum is the sum of every digit that appears in nums.

Return the absolute difference between the element sum and the digit sum of nums.

Constraints:

• $1 \leq$ nums.length $\leq 2000$

• $1 \leq$ nums[i] $\leq 2000$

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.