You are given an integer array nums containing positive integers.

We define an operation encrypt(x) that replaces every digit in an integer x with the largest digit in x.

Return the total sum of the encrypted integers in nums.

Constraints:

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

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

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.