✅💯🔥Simple Code📌🚀|  🎓🧠using two pointers | O(n) Time Complexity💀💯
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def findTheArrayConcVal(self, nums: List[int]) -> int:
        l=0
        r=len(nums)-1
        concat=0
        while l<r:
            sum=int(str(nums[l])+str(nums[r]))
            concat+=sum
            l+=1
            r-=1
        if l==r:
            concat+=nums[l]
        return concat

```
['Array', 'Two Pointers', 'Python', 'Python3']