to_string() ans stoi() jindabad ! :D handle size even odd utna hee bas :D
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```cpp []\nclass Solution {\npublic:\n    long long findTheArrayConcVal(vector<int>& nums) {\n        long long ans=0;\n        int n=nums.size();\n\n        for(int i=0;i<n/2;i++)\n        {\n            string s=to_string(nums[i]);\n            string k=to_string(nums[n-1-i]);\n\n            string o=s+k;\n            long long num=stoi(o);\n            ans+=num;\n        }\n        if(n%2!=0)\n        {\n            ans+=nums[n/2];\n        }\n        return ans;\n    }\n};\n```
['C++']