Two pointer easy
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```\nclass Solution {\n    public long findTheArrayConcVal(int [] nums) {\n        int P1=0,P2=nums.length-1;\n        String s="";\n        long sum=0;\n        while(P1<=P2){\n            if(P1==P2)s=String.valueOf(nums[P1]);\n            else  s=String.valueOf(nums[P1])+String.valueOf(nums[P2]);\n            sum+=Integer.parseInt(s);\n            P1++;\n            P2--;\n        }\n        return sum;\n    }\n}\n```
['Java']