Remove Nth Node From End

Problem

Remove the nth node from the end of a linked list, represented as an array.

Examples

Example 1

Input: {"values":[1,2,3,4,5],"n":2}

Output: [1,2,3,5]

Example 2

Input: {"values":[1,2],"n":2}

Output: [2]

Input and output use JSON-compatible values. For linked-list and tree questions, arrays represent the node structure as described above. Your code should implement solve(input).

Write your solutionImplement solve(input). Your draft is saved in this browser.

Compiler

How to solve Remove Nth Node From End

Remove the nth node from the end of a linked list, represented as an array. Try two pointers separated by n positions. The reference implementation illustrates this approach; check the example and edge cases.

Time and space complexity

O(n) time; O(1) auxiliary space for pointer-based deletion.

Practise and improve

Choose JavaScript, TypeScript or Python, complete the starter code, then select Run Tests. Request a hint when you need guidance, or choose View solution and confirm if you would like to study the reference implementation.