# Intersection of Two Linked Lists in Python

Suppose we have two linked lists A and B, there are few elements in these linked lists. We have to return the reference of the intersection points. The inputs are intersectionVal = 8, A = [4,1,8,4,5], B = [5,0,1,8,4,5], skipA = 2 and skipB = 3, these are used to skip 2 elements from A and skip 3 elements from B.

To solve this, we will follow these steps −

• Define a map called d
• while headA is not null
• while headB is not null
• Return null

## Example

Let us see the following implementation to get better understanding −

Live Demo

class ListNode:
def __init__(self, data, next = None):
self.data = data
self.next = next
class Solution(object):
"""
:rtype: ListNode
"""
dict = {}
return None
Intersect = ListNode(8, ListNode(4, ListNode(5)))
ob1 = Solution()
print("Intersection:",op.data)

## Input

headA = ListNode(4)
Intersect = ListNode(8, ListNode(4, ListNode(5)))
headB.next = ListNode(0, ListNode(1, Intersect))

## Output

Intersected at '8'

Updated on: 28-Apr-2020

821 Views