Intersection of Linked Lists

# Introduction

In this challenge, we will be working with linked lists to find the first common node among all the linked lists. The linked lists may have overlapping nodes, and our task is to implement a method that takes a list of head nodes of linked lists as input and returns the first common node. If there is no common node, the method should return null.