AlgoDaily - Find the Intersection of Two Linked Lists

Your Submissions

You haven't submitted any code for this challenge yet. Solve the problem by passing all the test cases, and your submissions will appear here.

xxxxxxxxxx
​
 
function getIntersection(list1, list2) {
  // fill in implementation for method
  return;
}
​
// Supporting data structures
​
class LinkedList {
  constructor() {
    this.head = null;
    this.tail = null;
  }
​
  prepend(newVal) {
    const currentHead = this.head;
    const newNode = new Node(newVal);
    newNode.next = currentHead;
    this.head = newNode;
​
    if (!this.tail) {
      this.tail = newNode;
    }
  }
​
  append(newVal) {
    const newNode = new Node(newVal);
    if (!this.head) {

OUTPUT

Results will appear here.