title: linked list problem
body: <p>Delete every 't'th (t>1) node of a single linked list. In the resultant linked list, again delete 't'th node. Repeat this till only t-1 nodes remains.</p>
  
  <p>For this i have come up with:
  Traverse until you reach 't'th node, delete all the nodes till the end.
  Is there any efficient way other than this?. Can any one please help me out. Thanks.</p>