find-the-array-concatenation-value
IntuitionApproachComplexity

Time complexity:
O(n)


Space complexity:
O(1)

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

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

# Complexity
- Time complexity:
O(n)

- Space complexity:
O(1)

# Code
```java []
class Solution {
    public long findTheArrayConcVal(int[] nums) {
        int n=nums.length;
            int i=0;
            int j=n-1;
            long ans=0;

            if (n%2!=0) {
                int k=n/2;
                ans+=(nums[k]);
            }
          
            while(i<j){ 
              
              
                    String s=String.valueOf(nums[i])+String.valueOf(nums[j]);
                    ans+=(Long.parseLong(s));
                    i++;
                    j--;
                
                

            }



            return ans;



    }
}
```
['Java']