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

4 votes104 views1 answer
Parsing string to int c#
C#
0 vote106 views1 answer
C# streamreader to file
C#
8 votes99 views3 answers
Save byte array to file c#
C#
0 vote94 views1 answer
Init stirng list c#
C#
3 votes212 views1 answer
Decimal sql how is on c#
C#
1 vote119 views1 answer
C# serviceCollection AddLogging
C#
2 votes64 views1 answer
Cursor visible unity
C#
60 votes154 views6 answers
Print to console c#
C#
9 votes98 views6 answers
Remove character from string C#
C#
0 vote122 views1 answer
How to invoke an AWS Lambda function asynchronously
C#