/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

8 votes315 views5 answers
Initialize vector c++
C++
1 vote224 views1 answer
Check if point is left or right of vector
C++
5 votes224 views6 answers
Ngrok http
C++
0 vote236 views1 answer
Faster solutions
C++
0 vote219 views1 answer
C++ construnctor
C++
9 votes204 views4 answers
Print vector of vector c++
C++
0 vote267 views1 answer
Youtube Video Downloder Website
C++
0 vote207 views1 answer
Int a=0; int b=30;
C++
0 vote208 views1 answer
C++ caps lock key
C++
18 votes224 views4 answers
Array length c++
C++