Reversing and then again reversing the answer will not be an efficient algorithm... on the fly computation of sum must be done...any ideas
On 8/14/10, Rahul Singhal <[email protected]> wrote: > I men to say ki just traverse from last instead of reversing it and storing > result in a stack in linked list form so that we dont need to reverse > again.Hope,i made myself clear. > > On Sat, Aug 14, 2010 at 11:40 PM, Lokesh Agarwal <[email protected]>wrote: > >> how can you traverse from last without reversing it. >> >> and there is no need fof using extra stack space. >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]<algogeeks%[email protected]> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > Rahul singhal > RnD Engineer > Tejas Networks > Mobile- 09916969422 > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
