ya first initialise first pointer to list. and move the other pointer n nodes. so when the second pointer reaches the last node.the first pointer which is n nodes from second ptr will be in its final position
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.