✅ Laconic Two Pointers
\n\n# Solution\nswift\nstruct Solution {\n    @_optimize(speed)\n    consuming func findTheArrayConcVal(_ nums: [Int]) -> Int {\n        let n = nums.count\n   
![Screenshot.png](https://assets.leetcode.com/users/images/838857ee-31db-44a2-826d-ecf75b81c958_1711607025.3758845.png)\n\n# Solution\n```swift\nstruct Solution {\n    @_optimize(speed)\n    consuming func findTheArrayConcVal(_ nums: [Int]) -> Int {\n        let n = nums.count\n        var concat = 0\n\n        for left in nums.indices[..<(n >> 1 + n & 0b1)] {\n            let right = n - left - 1\n            concat += left == right ? nums[left] : nums[left] ++ nums[right]\n        }\n        return concat\n    }\n}\n\nextension FixedWidthInteger {\n    func concatenating(with value: Self) -> Self {\n        Self.concatenating(self, with: value) + value\n    }\n\n    static func concatenating(_ rhs: Self, with lhs: Self) -> Self {\n        lhs / 10 == 0 ? rhs * 10  : concatenating(rhs * 10, with: lhs / 10)\n    }\n}\n\ninfix operator ++: AdditionPrecedence\n\nfunc ++ <T: FixedWidthInteger>(left: T, right: T) -> T {\n    left.concatenating(with: right)\n}\n```
['Array', 'Two Pointers', 'Swift', 'Simulation']