Merge point

int FindMergeNode(Node headA, Node headB) {
  Node currentA = headA;
  Node currentB = headB;

  // Do till the two nodes are the same
  while (currentA != currentB) {
    // If you reached the end of one list start at the beginning of the other
    // one currentA
    if (currentA.next == null) {
      currentA = headA;
    } else {
      currentA = currentA.next;
    }
    // currentB
    if (currentB.next == null) {
      currentB = headB;
    } else {
      currentB = currentB.next;
    }
  }
  return currentB.data;
}

Source: stackoverflow.com

Similar codes

1 vote328 views2 answers
C vs c
C#
0 vote323 views1 answer
How to start commvault services on linux
C#
0 vote313 views1 answer
Runner dotnet trace inside docker container
C#
2 votes296 views1 answer
New color unity
C#
8 votes769 views3 answers
C# char to int
C#
0 vote352 views1 answer
Freeze scene unity
C#Unity
28 votes323 views2 answers
Asp.net format datetime
C#
0 vote359 views1 answer
Generate random dark colors programatically in android
C#
31 votes302 views3 answers
C# adding to a list
C#
3 votes327 views1 answer
Change the text of inputfield unity
C#