This is a special case of the more general question: "Find the nth to last element of a singly linked list". The solution is to keep 2 pointers. Initialize both to the head of the list. Then advance 1 by n times and then advance both till the first encounters the end of the list. At that time the second pointer points to the nth to last element of the list.