Remove Nth Node From End of List

easy

Coding DSAReported May 2026 · Single-report-·-new frequency

Examples

Example 1

Input:
5
1 2 3 4 5
2
Output: 1 2 3 5

Example 2

Input:
5
1 2 3 4 5
5
Output: 2 3 4 5

Given the first node of a singly linked list and an integer n, where counting begins at 1 from the list's end.
Delete the node that is n positions from the tail, then return the resulting head node.
Constraint: the list must be processed with a single traversal.

Practice using a dummy leading node, since this approach applies broadly to linked-list removal tasks.
State the invariant aloud: once the initial loop finishes, fast is n nodes ahead of slow. In interviews, communicating this reasoning is often evaluated more heavily than the implementation itself.

easy

Coding DSAReported May 2026 · Single-report-·-new frequency

Example 1

Input:
5
1 2 3 4 5
2
Output: 1 2 3 5

Example 2

Input:
5
1 2 3 4 5
5
Output: 2 3 4 5

Given the first node of a singly linked list and an integer n, where counting begins at 1 from the list's end.
Delete the node that is n positions from the tail, then return the resulting head node.
Constraint: the list must be processed with a single traversal.

Practice using a dummy leading node, since this approach applies broadly to linked-list removal tasks.
State the invariant aloud: once the initial loop finishes, fast is n nodes ahead of slow. In interviews, communicating this reasoning is often evaluated more heavily than the implementation itself.