Not able to undestand the editorial sol

#1

Can you please explain the solution given in the editorial

#2

@bhavik911
In this question there will be one intersecting node between the two linked lists.

Here 15 is the intesecting node. So output will be 15.
The efficient way to do this problem is to use difference of node counts.

  1. Get count of the nodes in the first list, let count be c1.
  2. Get count of the nodes in the second list, let count be c2.
  3. Get the difference of counts d = abs(c1 – c2).
  4. Now traverse the bigger list from the first node till d nodes so that from here onwards both the lists have equal no of nodes.
  5. Then we can traverse both the lists in parallel till we come across a common node.
    (Note that getting a common node is done by comparing the address of the nodes).
#3

No I get this node , but the editorial one is slightly diff , this was covered in video and I get this one

Please explain the editorial one