EASY JS SOLUTION 🫠
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```javascript []\n/**\n * @param {number[]} nums\n * @return {number}\n */\nvar minElement = function(nums) {\n    let arr = []\n    for(let i =0;i<nums.length;i++){\n        let odi = nums[i].toString().split("").map(Number)\n        let sum = odi.reduce((acc,curr)=>acc+curr,0)\n        console.log(sum)\n        arr.push(sum)\n    }\n    return Math.min(...arr)\n};\n```
['JavaScript']