Easy to understand Java Solution
ApproachActually we do not need to convert each number in the arrayinto a string and then iterate through the string to get the sum of the digits as Hint 1 impl
# Approach
<!-- Describe your approach to solving the problem. -->
Actually we do not need to convert each number in the array 
into a string and then iterate through the string to get the sum of the digits as Hint 1 implies.

Instead what we can do is iterate through each number in the array. We then perform the following operation: 

- take the number % 10 to get the first digit of the number
- then divide the number by 10 since we want to get the next digits in the number in following iterations
- and then add the digit to a variable you assigned outside the iteration like "sum"
- continue these operations until the number < 0

Ofcourse after we did these operations we then check if we saw a sum of digits that was smaller or if the sum that we just computed is infact the smallest, since we do need to return the minmum sum of digits in the array.

# Time Complexity
O(n * m)
n: length of array
m: amount of digits in num


# Code
```java []
class Solution {
    public int minElement(int[] nums) {
        int minElem = Integer.MAX_VALUE;

        for (Integer num : nums) {
            int sum = 0;

            while (num > 0) {
                int digit = num % 10;
                num /= 10;
                sum += digit; 
            }

            minElem = minElem > sum ? sum : minElem;
        }

        return minElem;
    }
}
```
['Java']