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

2 votes224 views2 answers
Default route in asp.net core
C#
0 vote237 views1 answer
Make picturebox outline
C#
0 vote215 views1 answer
Can't select ui in scene view unity
C#
0 vote216 views1 answer
Collection to datatable c#
C#
6 votes226 views2 answers
String interpolation in C#
C#
0 vote227 views1 answer
Set teh screen rect of camera unity
C#
29 votes242 views3 answers
Online embedded c compiler
C#
0 vote217 views1 answer
Save file dialog filter c#
C#
1 vote265 views1 answer
How to cast list to observablecollection c#
C#
0 vote217 views1 answer
Create app() import vue cli
C#