2ms solution 
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int minElement(int[] nums) {
        int min = nums[0];
        for(int i=0; i<nums.length; i++){
            int temp = nums[i];
            char[] ch = String.valueOf(temp).toCharArray();
            int sum = 0;
            
            for(int j=0; j<ch.length; j++){
                sum += Character.getNumericValue(ch[j]);
            }
    
            min = Math.min(min, sum);
        }
        return min;
    }
}
```
['Java']