/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

0 vote336 views2 answers
C++ char it is a number
C++
0 vote331 views1 answer
This is my p phone number in punjabi
C++
0 vote342 views4 answers
How to make a square root function in c++ without stl
C++
0 vote340 views1 answer
Lcm function c++
C++
1 vote337 views1 answer
Isprime c++
C++
1 vote349 views1 answer
C++ split long code
C++
2 votes318 views1 answer
Std string to const char * c++
C++
0 vote327 views1 answer
C++ exam
C++
1 vote317 views1 answer
Function overloading in c++
C++
0 vote371 views1 answer
C++ get pointer from unique_ptr
C++