title: print second third of a linked list
body: <p><strong>There is a list of n nodes.</strong></p>
  
  <p><strong>I have to write a pseudo code that prints the nodes of the second third of the list by using 3 pointers. what is the complexity?</strong></p>
  
  <p>if I could use by counter, it was easy, but it's forbidden.</p>
  
  <p>I think about putting three pointers of the first three nodes, and then get next to the third pointer. if it's not the end node, get next to the second.. but my pseudo code is too long and complex.</p>
  
  <p><strong>another question: how can I do it by using two pointers?</strong></p>
  
  <p>for example: the list: 1->2->3->4->5->6->7->8->9 sould prints the elements: 4,5,6.</p>
  
  <p>any help appreciated!</p>