title: Finding end of linked list
body: <p>I'm looking over interview questions, and I came across "How do you find out if a linked-list has an end? (i.e. the list is not a cycle)."  It gives a solution (traverse it one and two nodes at a time, and see if the pointers are ever equal).</p>
  
  <p>Couldn't we just keep the pointer that we start at and see if while traversing it, we ever hit that pointer again?  Or will that not work?</p>