/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 vote110 views1 answer
Socket programming in cpp
C++
-1 vote100 views1 answer
Pointer to constant
C++
1 vote111 views1 answer
Prime number generator c++
C++
0 vote98 views1 answer
C++ generate a random letter
C++
20 votes110 views5 answers
How to print in c++
C++
1 vote123 views1 answer
Iff arduino
C++
1 vote117 views2 answers
Calling by reference c++
C++
-1 vote93 views1 answer
How to array in c++
C++
1 vote100 views1 answer
Cmake define standard c++
C++
5 votes114 views1 answer
Break in c++
C++