Home/

...

/

Remove nth Node from End of List

Remove nth Node from End of List

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 kk.

  • 1≤1 \leq kk ≤103\leq 10^3

  • −103≤−10^3 \leq Node.value ≤103\leq 10^3

  • 1≤1 \leq n ≤k\leq k

Examples

Press + to interact
canvasAnimation-image
1 / 4

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

1

What is the output if the following linked list and value of nn are given as input?

Linked list: 32 → 78 → 65 → 90 → 12 → 44 → NULL

nn = 3

A)

32 → 78 → 90 → 12 → 44 → NULL

B)

32 → 78 → 65 → 12 → 44 → NULL

C)

78 → 65 → 90 → 12 → 44 → NULL

D)

32 → 78 → 65 → 90 → 12 → NULL

Question 1 of 30 attempted

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.

Sequence - Vertical
Drag and drop the cards to rearrange them in the correct sequence.
1
2
3
4
5
6

Try it yourself

Implement your solution in the following coding playground.

Press + to interact
Java
usercode > Solution.java
// Definition for a Linked List node
// class ListNode {
//     int val;
//     ListNode next;
//     // Constructor
//     public ListNode(int val) {
//         this.val = val;
//         this.next = null;
//     }
// }
import ds_v1.LinkedList.ListNode;
import java.util.*;
class Solution {
    public static ListNode removeNthLastNode(ListNode head, int n) {
        
        // Replace this placeholder return statement with your code
        
        return head;
    }
}
Remove Nth Node from End of List

Access this course and 1200+ top-rated courses and projects.