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

17 votes102 views4 answers
Height of binary tree
C#
1 vote142 views1 answer
C# ipaddress from localhost
C#
0 vote125 views1 answer
C# resize window without title bar
C#
0 vote133 views1 answer
SQLite Parameters
C#
0 vote150 views2 answers
C# for loop Statement
C#
1 vote161 views1 answer
Make an enemy go towards player unity
C#Unity
0 vote120 views1 answer
Asp.net mvc 5 codefirst dropdown list
C#
0 vote125 views2 answers
Getawaiter and no extension method
C#
0 vote124 views1 answer
Invert string c#
C#
0 vote127 views1 answer
Usermanager find based on role
C#