You are given an integer array nums.

Replace each element in nums with the sum of its digits.

Return the minimum element in nums after performing the replacement on all elements.

Constraints:

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

• $1 \leq$ nums[i] $\leq 10^4$

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.