You are given an integer array nums.

The digit range of an integer is defined as the difference between its largest digit and its smallest digit.

Find the maximum digit range among all elements in nums, and return the sum of all elements that achieve this maximum digit range.

Constraints:

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

• $10 \leq$ nums[i] $\leq 10^5$

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.