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 vote189 views1 answer
WebClient timeout
C#
3 votes184 views2 answers
C# console header
C#
2 votes193 views1 answer
How to copy a file in C#
C#
-1 vote295 views1 answer
How to add colider in obj in unity 2020
C#
-1 vote182 views2 answers
Git find commits by message
C#
0 vote196 views1 answer
Loading screen unity
C#
1 vote204 views1 answer
Save method in asp.net
C#
0 vote220 views1 answer
Access label from another class c#
C#
0 vote209 views1 answer
C# core deploy on gcp with powershell
C#
0 vote186 views1 answer
Invert bool c#
C#