it was 4 -> 5, not 4 -> 5 -> 6 On Wed, Jul 4, 2012 at 10:41 PM, Abhi <abhi120...@gmail.com> wrote:
> Any efficient algorithm to find intersection of two linked lists.Example: > Linked List 1) 1 -> 2 -> 3 -> 4 -> 5 -> 6 > Linked List 2) 3 -> 4 -> 5 > > Intersection 4 -> 5 -> 6 > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/-8_lnGA-ZhgJ. > 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. > -- Abhishek Sharma Under-Graduate Student, PEC University of Technology -- 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.
