✅C++ || EASY && CLEAN && StraightForward CODE
\n\nT->O(n/2) && S->O(1)\n\n\tclass Solution {\n\tpublic:\n\t\tlong long findTheArrayConcVal(vector& nums) {\n\t\t\tint n = nums.size();\n\t\t\tint i = 0,j = n-
![image](https://assets.leetcode.com/users/images/2e8bb38f-e672-4328-82b2-ea947f8328fd_1676175561.676634.png)\n\n**T->O(n/2) && S->O(1)**\n\n\tclass Solution {\n\tpublic:\n\t\tlong long findTheArrayConcVal(vector<int>& nums) {\n\t\t\tint n = nums.size();\n\t\t\tint i = 0,j = n-1;\n\t\t\tlong long ans = 0;\n\n\t\t\twhile(j > i){\n\t\t\t\tstring temp = to_string(nums[i]) + to_string(nums[j]);\n\t\t\t\ti++;\n\t\t\t\tj--;\n\t\t\t\tans += stoll(temp);\n\t\t\t}\n\n\t\t\tif(n % 2 == 1) ans += nums[i];\n\n\t\t\treturn ans;\n\t\t}\n\t};
['Two Pointers', 'C', 'C++']