Sum Each Pair
Walk the list two nodes at a time and replace each pair with one node holding their sum. If the list has an odd length, the last node stays on its own as it is. Return the head of the new list. The list is passed in as head.
Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.
Example 1
head [1,2,3,4,5]
returns [3,7,5]
1+2, 3+4, then the lone 5.
Example 2
head [6,-6]
returns [0]
One pair summing to 0.
Constraints
0 <= number of nodes <= 100-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Linked lists problems
- Swap Nodes in PairsEasy
- Values That Appear OnceEasy
- Add Two NumbersMedium
- Add Two Numbers IIMedium
- Cancel Opposite NeighborsMedium
- Delete the Middle NodeMedium
- Evens Before OddsMedium
- Last One StandingMedium