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 vote100 views1 answer
C# list remove duplicate items
C#
2 votes101 views1 answer
Add a dictionary to another dictionary c#
C#
1 vote94 views2 answers
No context type was found in the assembly 'AuthenticationApp'.
C#
0 vote97 views1 answer
Nunjucks conditional
C#
1 vote99 views1 answer
C# add int var
C#
0 vote102 views3 answers
Get current location latitude and longitude in android
C#
0 vote95 views1 answer
C# xml comment type reference
C#
0 vote109 views1 answer
Asp.net mvc table array binding arbitrary indices
C#
1 vote86 views1 answer
Blazor option selected
C#
11 votes87 views1 answer
Random() C# grepper
C#