1. Given the heads of two singly linked-lists headA and headB 2. Return the node at which the two lists intersect. 3. If the two linked lists have no intersection, return null.
Input Format
Input is managed for you.
Output Format
Output is managed for you.
Constraints
0 <= N <= 10^6
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
4 14 12 8 7 2 4 7 2 6 5
Output
8