CareerCup

A Linked list.(Each node can point to the previous and next node).It is easier to add nodes to the end of a linked list. If you use an array you would either need to resize it or initialise it to the maximum possible snake length to start(which is a waste of memory)

Single Linked List would be better in terms of memory. Since a snake's body length would increase every time it ate something, it is better to have pointer to the last node of the list. This would allow better insertions at the end of the list.

@Rohan: I accept with u. Each movement of snake need to be searched for existence of that new covered point in its list. This costs O(snake length). Its better to have extra hash as well. so searching can be done quickly.
Finally, LL for order of points covered by snake and hash to search for correctness.

Just a linklist for snake's body and a 2-d matrix for the game board should also suffice, right?

what has bitten the snake?