C++ easy to understand solution
Intuition :\nMoving towards middle from extreme ends.\n Describe your first thoughts on how to solve this problem. \n\n# Approach :\nTaking pointer to start and
# Intuition :\nMoving towards middle from extreme ends.\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach :\nTaking pointer to start and end , traversing towards each other at constant rate. Applying formula at each iteration to get final result.\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code :\nHere is the code:\n```\nclass Solution {\npublic:\n    int siz(int n){\n        int s = 0;\n        while(n>0){\n            s++;\n            n /= 10;\n        }\n        return s;\n    }\n    long long findTheArrayConcVal(vector<int>& nums) {\n        if(nums.size()==1)\n        return nums[0];\n        long long ans = 0;\n        int i=0;\n        int j = nums.size()-1;\n        while(i<j){\n            ans += nums[i]*pow(10 , siz(nums[j])) + nums[j];\n            i++;\n            j--;\n            if(i==j)\n            ans += nums[j];\n        }\n        return ans;\n    }\n};\n```
['Array', 'Two Pointers', 'C++']