seem like very twisted problem :P :P . lot of restriction. On Thu, Dec 15, 2011 at 7:30 PM, Ankur Garg <[email protected]> wrote:
> Twisted linked list problem: Two linked lists merge at some node p,both > the head pointers are given find the merging point under > the following restrictions. > 1. You should not traverse to the end any of the linked list. > 2. Merge node p should be detected by the time you reach at most most k > nodes from p. > 3. Space should not exceed by k units. > 4. No saving of nodes to hard discs. > 5. No recursion. > > Regards > Ankur > > -- > 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.
