/C++/Give an algorithm for finding the ith-to-last node in a singly linked list in which the last node is indicated by a null next reference.

Give an algorithm for finding the ith-to-last node in a singly linked list in which the last node is indicated by a null next reference.

LinkedListNode nthToLast(LinkedListNode head, int n) {
  if (head == null || n < 1) {
    return null;
  }

  LinkedListNode p1 = head;
  LinkedListNode p2 = head;

  for (int j = 0; j < n - 1; ++j) { // skip n-1 steps ahead
    if (p2 == null) {
      return null; // not found since list size < n
    }
    p2 = p2.next;
  }

  while (p2.next != null) {
    p1 = p1.next;
    p2 = p2.next;
  }

  return p1;
}

Source: stackoverflow.com

Similar codes

1 vote184 views1 answer
Il2cpp unity stuck c#
C++
1 vote196 views1 answer
Hexadecimal or binary to int c++
C++
0 vote180 views1 answer
130 divided by -10
C++
0 vote198 views1 answer
How to use a non const function from a const function
C++
0 vote262 views1 answer
Vector init c++
C++
0 vote220 views1 answer
C++ freecodecamp course 10 hours youtube
C++
0 vote193 views1 answer
Taking integer input from file in c++
C++
8 votes183 views2 answers
‘setprecision’ was not declared in this scope
C++
1 vote196 views1 answer
What is difference between single inverted and double inverted in programming languages
C++
0 vote164 views4 answers
C++ to c converter
C++