/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 vote148 views1 answer
Cpp map contains
C++
0 vote96 views2 answers
Average of vector c++
C++
1 vote169 views2 answers
Pain
C++
0 vote123 views1 answer
C++ include <> vs ""
C++
0 vote138 views1 answer
How to bath without water
C++
2 votes133 views6 answers
Loop in c++
C++
0 vote149 views1 answer
How to point to next array using pointer c++
C++
1 vote168 views1 answer
Arduino notone
C++
70 votes205 views5 answers
Erase element from vector c++
C++
0 vote144 views1 answer
Rectangle Area hackerrank in c++
C++