✅ Two-liner, 23ms Beats 100.00%
Solution 1 \u2014 Two-liner\n\n24ms Beats 94.44%\n\nswift\nfunc findTheArrayConcVal(_ nums: [Int], _ i: Int = 0) -> Int {\n    guard i != nums.count / 2 else { 
# Solution 1 \u2014 Two-liner\n\n24ms Beats 94.44%\n\n```swift\nfunc findTheArrayConcVal(_ nums: [Int], _ i: Int = 0) -> Int {\n    guard i != nums.count / 2 else { return nums.count % 2 == 0 ? 0 : nums[i] }\n    return Int(String(nums[i]) + String(nums[nums.count - 1 - i]))! + findTheArrayConcVal(nums, i + 1)\n}\n```\n\n# Solution 2\n\n23ms Beats 100.00%\n\n```swift\nfunc findTheArrayConcVal(_ nums: [Int], _ i: Int = 0) -> Int {\n    guard i != nums.count / 2 else { return nums.count % 2 == 0 ? 0 : nums[i] }\n    return concatenated(nums[i], nums[nums.count - 1 - i]) + findTheArrayConcVal(nums, i + 1)\n}\n\nprivate func concatenated(_ n: Int, _ m: Int) -> Int {\n    concatenationHead(n, m) + m\n}\n\nprivate func concatenationHead(_ n: Int, _ m: Int) -> Int {\n    m / 10 == 0 ? n * 10 : concatenationHead(n * 10, m / 10)\n}\n```
['Recursion', 'Swift']