Easy solution with step by step
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 findTheArrayConcVal = function(nums) {\n\n    let resultValue = 0;\n\n    while(nums.length > 0 ){\n\n    if(nums.length > 1){\n\n        const first = nums.shift().toString()\n        const last  = nums.pop().toString()\n\n        resultValue += Number(first+last);\n    }else{\n        resultValue += nums.pop()\n    }\n\n}\n\nreturn resultValue;\n    \n};\n```
['TypeScript', 'JavaScript']