Insert a new node into a singly linked list (a) before and (b) after a node pointed to by p in this list (possibly the first or the last). Do not use a loop in either operation.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.