package ctci.chapter2LinkedLists;

/**
 * Created by a502219 on 6/01/2016.
 */
public class q8 {
//TODO
    /*
    * Loop detection
    *
    * Given a circular linked list, implement an algorithm that returns the node at the beginning of the loop.
    *
    * EXAMPLE
    * Input: A->B->C->D->E->C (the same C as earlier)
    * Output: C
    * */
}
