Search
⌘K

Leetcode 2562. Find the Array Concatenation Value

Repeatedly form the numeric concatenation of the first and last elements of an integer array (removing them) and sum these values, adding the lone middle element if the length is odd. The problem reduces to a two-pointer traversal computing each concatenation by accounting for the right element's digit length.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.