Using Arrays.sort() in java
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 [] ans = new int[nums.length];
        // int sum_digit=0;
        for(int i=0;i<nums.length;i++){
              if(nums[i]>=10){
            while(nums[i]>0){
                
                ans[i] +=nums[i]%10;
                nums[i]/=10;
            }
            }
            else{
                ans[i]=nums[i];
            }
            
        }
        Arrays.sort(ans);
        return ans[0];
    }
}
```
['Java']