Q: Reverse linked list.
Create a new pointer, so you have one on the original list
and one for the new list. Add the first node from the old
list to the new list and increment the old pointer.
From then on, get the top node (call it N) of the old list,
increment the old counter, set N.next equal to the new
pointer's value, and set the new pointer to N.