Maximum Twin Sum of a Linked List Problem

Maximum Twin Sum of a Linked List Problem — ExecCode Easy DSA Practice

Solve the Maximum Twin Sum of a Linked List problem on ExecCode. Free online easy DSA practice in Linked List. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given the head of a linked list with even length, return the maximum twin sum of the linked list. Your task is to in a linked list of size n, where n is even, the i^th node (0-indexed) of the linked list is known as the twin of the (n-1-i)^th node, if 0 <= i <= (n / 2) - 1. For example, if n = 4, then node 0 is the twin of node 3, and node 1 is the twin of node 2. These are the only nodes with twins for n = 4. The twin sumis defined as the sum of a node and its twin. Return the required answer exactly as shown in the examples.

Examples

Input {"nums": [5, 4, 2, 1]}; Output 6

Constraints

The number of nodes in the list is an even integer in the range [2, 10^5]. 1 <= Node.val <= 10^5

Practice Maximum Twin Sum of a Linked List free on ExecCode. Browse DSA problems, topic map, and placement guides.