Find Intersection Point

1def getIntersectionNode(headA, headB):
2    # Calculate lengths of both lists
3    lenA, lenB = 0, 0
4    currA, currB = headA, headB
5 
6    while currA:
7        lenA += 1
8        currA = currA.next
9 
10    while currB:
11        lenB += 1
12        currB = currB.next
13 
14    # Reset pointers to heads
15    currA, currB = headA, headB
16 
17    # Move the longer list's pointer ahead
18    if lenA > lenB:
19        for _ in range(lenA - lenB):
20            currA = currA.next
21    elif lenB > lenA:
22        for _ in range(lenB - lenA):
23            currB = currB.next
24 
25    # Move both pointers together
26    while currA and currB:
27        if currA == currB:
28            return currA
29        currA = currA.next
30        currB = currB.next
31 
32    return None