remove the 'n' nodes from the beginning..push in the stack..pop them up and insert at the end of linked list..till the stack becomes empty..do this for(m/n) times..m is length of list.. correct me if i am wrong
On Wed, Aug 31, 2011 at 6:57 AM, Reynald Suz <reynaldsus...@gmail.com>wrote: > Question: > Given: A singly linked list and a number 'n'. > Write a program, that will reverse consecutive 'n' nodes in the linked > list. > Optimize for space and time. > > Example: > Input: > Linked list: A->B->C->D->E->F > number 'n': 3 > > Output: > C->B->A->F->E->D > > > -- > Regards > Reynald Reni > Masters in Software Engineering > CIT - India > > -- > 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. > -- *Dheeraj Sharma* Comp Engg. NIT Kurukshetra -- 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.
