/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 vote194 views1 answer
Define a type in c++
C++
1 vote186 views1 answer
Map in c
C++
14 votes149 views5 answers
C++ Type Casting
C++
1 vote213 views1 answer
Find the graph is minimal spanig tree or not
C++
3 votes192 views1 answer
Repeat character n times c++
C++
0 vote214 views1 answer
Youtube Video Downloder Website
C++
0 vote197 views1 answer
Walk filesystem in c++
C++
0 vote218 views2 answers
GCD(x, yz)
C++
4 votes173 views2 answers
C++ inline if
C++
-1 vote172 views1 answer
Int to hexadecimal in c++
C++