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

0 vote135 views1 answer
Selecting multiple columns with linq query and lambda expression
C#
7 votes131 views1 answer
C# tostring mmm dd yyyy
C#
0 vote127 views1 answer
How to display array in string in c#
C#
1 vote131 views1 answer
What is data encapsulation c#
C#
0 vote114 views1 answer
Unity gun clipping through walls
C#
0 vote114 views1 answer
Devexpress spreadsheet document source wpf
C#
0 vote121 views1 answer
Il c#
C#
1 vote117 views4 answers
Catch multiple exception c#
C#
0 vote111 views1 answer
C# week refrences
C#
2 votes124 views1 answer
Command to create blazor server app using cli commands
C#