Maximum twin sum in a Linked List

[deeksha04-alt]

You are given 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 sum is defined as the sum of a node and its twin.

Given the head of a linked list with even length, return the maximum twin sum of the linked list.

[deeksha04-alt]

kindly assign me the above issue @gdsc-igdtuw @Parul-Mann

[gh4abhi]

Please assign this to me.

[bh-g]

Please assign this issue to me @Parul-Mann @gdsc-igdtuw

[BhavyaDevani]

@Parul-Mann pls assign this issue to me

[jyotika6221]

@Parul-Mann kindly assign this issue to me