Find the middle node of a Linked List
Given a Singly Linked List, write an algorithm to find the middle node. You may not use more than one loop of any kind.
Problem Statement
Given a Singly Linked List, write an algorithm to find the middle node. You may not use more than one loop of any kind.
Evaluation
 Completeness of the C# or pseudocode algorithm (25%)
 Correctness of the algorithm, demonstrated by quick manual unit tests (25%)
 What is the time and space complexity, and is it efficient? (25%)
 Modify it to find the node that is 3/4 of the way down instead of 1/2? (25%)
References
I was asked this question during a Microsoft interview
Recommended reading

Circular Linked List Detection
A linked list is given. Write an algorithm that detects whether it's a singly linked list or a circularly linked list.

Graph Cycle Detection
You have a directed connected graph. Write an algorithm that detects any cycle, if one exists, and returns a list of its nodes.

Reverse a Singly Linked List
Implement the algorithm to reverse a singly linked list.

Tree InOrder Traversal to Next Node
Given a node in a binary tree, implement the algorithm for finding its next inorder node in the containing tree.
 Author
 Amin Ariana
 Published
 May 2007