Given the head of a linked list, remove the nth node from the end and return the head.
Input: 1→2→3→4→5, n=2 Output: 1→2→3→5 Input: 1, n=1 Output: []
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features