Remove N-th Node from end of Singly Linked List

In this article, we have explained two approaches to Remove N-th Node from end of Singly Linked List. We can do this in single pass / one traversal in O(N) time.

Table of contents:

Introduction to Linked ListApproach 1: Making two passes through Linked ListApproach 2: Going through the list once, one pass

Prerequisites: Singly Linked List, Slow Fast pointer technique

Similar problems you should learn about:

Delete operation in Linked ListDelete Middle node of Linked List

This is similar t...