Insert Sum Between Neighbors
Between every two neighboring nodes, insert a new node holding the sum of those two nodes. For 1 -> 4 -> 2 the answer is 1 -> 5 -> 4 -> 6 -> 2. Return the head. 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,4,2]
returns [1,5,4,6,2]
1+4 = 5 and 4+2 = 6 are inserted.
Constraints
0 <= number of nodes <= 50-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.