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 vote340 views1 answer
Listview disable resize columns
C#
0 vote346 views1 answer
Quotes in quotes in c#
C#
0 vote350 views1 answer
Linq c# object except two lists
C#
0 vote338 views1 answer
Unity using tmpro not working
C#
0 vote340 views1 answer
How to set unique constraint from EF core
C#
0 vote345 views1 answer
Get vector direction unity
C#
0 vote358 views2 answers
Docker-compose cassandra db
C#
0 vote386 views1 answer
C# url relative path remove
C#
0 vote345 views1 answer
How to we put a link in button in a view in asp.net
C#
0 vote362 views1 answer
Static Keyword
C#