Intersection of Linked Lists

Write a program to find the node at which the intersection of two singly linked lists begins.

For example, the following two linked lists:


A:          a1 → a2
                   ↘
                     c1 → c2 → c3
                   ↗
B:     b1 → b2 → b3

begin to intersect at node c1.

Notes:

  • If the two linked lists have no intersection at all, return null.
  • The linked lists must retain their original structure after the function returns.
  • You may assume there are no cycles anywhere in the entire linked structure.
  • Your code should preferably run in O(n) time and use only O(1) memory.

Problem approach completely explained :

Complete code in the hints section.

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
Start solving Intersection of Linked Lists on Interview Code Editor
Sign Up
to access hints and editorial solutions for Intersection of Linked Lists
6502 successful submissions.
Asked In:
  • Amazon
  • Microsoft
  • NetApp
  • Apache Design
Click here to start solving coding interview questions