Challenge: Insertion at Tail

Statement

Given the head of a linked list and a target, value, return the updated linked list head after adding the target value at the end of the linked list.

Constraints:

Let n be the number of nodes in the linked list:

• $0 \leq$ n $\leq 5 \times 10^2$

• $-5 \times 10^3 \leq$ node.data, value $\leq 5 \times 10^3$

Examples