/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 vote249 views1 answer
Check .h files syntax c++
C++
-2 votes282 views2 answers
Constants in cpp
C++
0 vote254 views1 answer
Pow without math.h
C++
0 vote262 views1 answer
How to store pair in min heap in c++
C++
5 votes273 views10 answers
Array
C++
0 vote239 views1 answer
How to download c++ portable compiler
C++
1 vote249 views1 answer
Unclebigbay
C++
1 vote279 views1 answer
STD::ERASE FUNCTION IN C++
C++
1 vote252 views1 answer
System cpp
C++
0 vote272 views1 answer
Filling 2d array with 0 c++
C++