Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2562. Find the Array Concatenation Value
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source