Leetcode 2130: Maximum Twin Sum of a Linked List
3 min readJan 9, 2022
In this problem, we are working with Linked Lists and need to return the maximum sum of “twin” elements, defined in the following way:
In a linked list of size
n
, wheren
is even, theith
node (0-indexed) of the linked list is known as the twin of the(n-1-i)th
node, if0 <= i <= (n / 2) - 1
.
For example, ifn = 4
, then node0
is the twin of node3
, and node1
is the twin of node2
. These are the only nodes with twins forn = 4
.
The twin sum is defined as the sum of a node and its twin.Given the
head
of a linked list…