/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 vote131 views1 answer
How to concatinate two strings in c++
C++
0 vote354 views1 answer
C++ find object in vector by attribute
C++
1 vote121 views1 answer
Vector2 c++
C++
1 vote137 views1 answer
Union cpp
C++
0 vote170 views1 answer
Assert warning c++
C++
1 vote135 views1 answer
Insert binary search tree
C++
0 vote137 views2 answers
C++ to mips converter online
C++
0 vote147 views1 answer
How to add external library in clion
C++
9 votes129 views4 answers
C++ sqrt
C++
1 vote138 views1 answer
Uri online judge 3145 solution in c++
C++