title: Beginning of loop in doubly linked list?
body: <p>One question I came across, 
  In a circular linked list, find node at the beginning of the loop?</p>
  
  <p>EXAMPLE Input: A -> B -> C -> D -> E -> C [the same C as earlier] Output: C</p>
  
  <p>Can one of the solutions be, to see if the address of value stored at these nodes are same?</p>
  
  <p>So something like &amp;(A->value) would return us address and then we find if an address is repeating, if yes that is the beginning of the loop? </p>