Design a generic Linked List in Java. Follow up: given access only to the head of the list, return the middle element.
Sigiloso
My answer was to first determine the length of the list and then go half the way. They suggested another approach, the slow and fast runner pointers. Both solutions would run in O(n) though.