title: what is the approach to solve circular linked list?
body: <p>Given a circular linked list, impplement an algorithm which returns node at the beginning of the loop.</p>
  
  <p>DEFINITION:
  Cicular Link list: A(corrupt) linked list in which a node's next pointer points to an earlier node, so as to make a loop in the linked list.</p>
  
  <p>EXAMPLE:
  Input: A->B->C->D->E->C[the same C as earlier]
  Output: C</p>