Find Intersection Node of Two Linked Lists

amazon Find the intersection node of two singly linked lists. The linked lists may or may not intersect. The time complexity should be O(N). Example Input listA: [4,1], listB: [5,6,1], intersection: [8,4,5]