/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 vote125 views1 answer
Factore of 20 in c+
C++
0 vote128 views1 answer
Cstring to string
C++
9 votes130 views3 answers
C++ throw exception
C++
0 vote125 views1 answer
Size of set c++
C++
0 vote120 views1 answer
Iteration in c++
C++
0 vote127 views1 answer
How to change the value of a key in hashmp in c++
C++
2 votes129 views1 answer
What is -> in c++
C++
0 vote132 views2 answers
C++ programming code to remove all characters from string except alphabets
C++
0 vote115 views1 answer
C++ rename function
C++
18 votes126 views5 answers
Cpp rand
C++