**Problem Statement:**
Given the required input arguments, write an efficient algorithm to solve the **Intersection of Two Linked Lists** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge.
**Hint / Expected Approach:**
Two-pointer length equalization trick
**Edge Cases to Consider:**
- (1) No intersection
- (2) Same list
- (3) Lists of different lengths
Examples
Example 1
Input:A=[4,1,8,4,5], B=[5,6,1,8,4,5], intersect at node 8
Output:Node with value 8
Explanation: Standard intersection
Example 2
Input:A=[1,9,1,2,4], B=[3,2,4], intersect at node 2
Output:Node with value 2
Explanation: Different lengths
Example 3
Input:A=[2,6,4], B=[1,5], no intersection
Output:null
Explanation: No intersection
Constraints
▪The number of nodes in the list is in the range [0, 500]