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 [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.
