/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 vote222 views1 answer
Priority queue ordered by second element
C++
0 vote184 views2 answers
Get min and max element index from vector c++
C++
0 vote194 views1 answer
Shift element to end of vector c++
C++
0 vote213 views1 answer
Could not load the Visual C++ component "VCBuild.exe". To fix this, 1) install the .NET Framework 2.0 SDK, 2) install Microsoft Visual Studio 2005 or 3) add the location of the component to the system path if it is installed elsewhere.
C++
1 vote188 views1 answer
Cpp executing without console
C++
29 votes345 views6 answers
Convert string to number c++
C++
0 vote192 views2 answers
C++ string to wstring
C++
0 vote208 views3 answers
How to make loop in c++
C++
0 vote224 views1 answer
Is palindrom
C++
0 vote205 views1 answer
Assignment of single field in struct in solidity
C++