Try to solve the Remove Nth Node from End of List problem.
Statement
Given the head of a singly linked list and an integer n, remove the nth node from the end of the list and return the head of the modified list.
Constraints:
- The number of nodes in the list is .
-
Node.value -
n
Examples
Understand the problem
Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:
Remove Nth Node From End of List
What is the output if the following linked list and value of are given as input?
Linked list: 32 → 78 → 65 → 90 → 12 → 44 → NULL
= 3
32 → 78 → 90 → 12 → 44 → NULL
32 → 78 → 65 → 12 → 44 → NULL
78 → 65 → 90 → 12 → 44 → NULL
32 → 78 → 65 → 90 → 12 → NULL
Figure it out!
We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.
Try it yourself
Implement your solution in the following coding playground.
# Definition for a Linked List node# class ListNode:# def __init__(self, val=0, next=None):# self.val = val# self.next = nextfrom ds_v1.LinkedList.LinkedList import ListNodedef remove_nth_last_node(head, n):# Replace this placeholder return statement with your codereturn None