def intersection(h1, h2):
    """
    This function takes two lists and returns the node they have in common, if any.
    In this example:
    1 -> 3 -> 5
                \
                 7 -> 9 -> 11
                /
    2 -> 4 -> 6
    ...we would return 7.
    Note that the node itself is the unique identifier, not the value of the node.
    """
    count = 0
    flag = None
    h1_orig = h1
    h2_orig = h2
    while h1 or h2:
        count += 1
        if not flag and (h1.next is None or h2.next is None):
            # We hit the end of one of the lists, set a flag for this
            flag = (count, h1.next, h2.next)
        if h1:
            h1 = h1.next
        if h2:
            h2 = h2.next
    long_len = count  # Mark the length of the longer of the two lists
    short_len = flag[0]
    if flag[1] is None:
        shorter = h1_orig
        longer = h2_orig
    elif flag[2] is None:
        shorter = h2_orig
        longer = h1_orig
    while longer and shorter:
        while long_len > short_len:
            # force the longer of the two lists to "catch up"
            longer = longer.next
            long_len -= 1
        if longer == shorter:
            # The nodes match, return the node
            return longer
        else:
            longer = longer.next
            shorter = shorter.next
    return None


class Node(object):
  def __init__(self, val=None):
    self.val = val
    self.next = None


def test():
    def printLinkedList(head):
        string = ""
        while head.next:
            string += head.val + " -> "
            head = head.next
        string += head.val
        print(string)

    # 1 -> 3 -> 5
    #            \
    #             7 -> 9 -> 11
    #            /
    # 2 -> 4 -> 6

    a1 = Node("1")
    b1 = Node("3")
    c1 = Node("5")
    d = Node("7")
    a2 = Node("2")
    b2 = Node("4")
    c2 = Node("6")
    e = Node("9")
    f = Node("11")

    a1.next = b1
    b1.next = c1
    c1.next = d
    a2.next = b2
    b2.next = c2
    c2.next = d
    d.next = e
    e.next = f

    printLinkedList(a1)
    printLinkedList(a2)
    print(intersection(a1, a2))
    assert intersection(a1, a2).val == d.val

test()

Add new linkedlist file for intersection