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, remove the node from the end of the list and return its head.
Constraints:
- The number of nodes in the list is
k. -
k -
Node.data -
nk
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 RemoveNthLastNode.java in the following coding playground. You will need the provided supporting code to implement your solution.
// Definition for a Linked List node// class LinkedListNode {// public int data;// public LinkedListNode next;// public LinkedListNode(int data) {// this.data = data;// this.next = null;// }// }import java.util.*;class RemoveNthNode {public static LinkedListNode removeNthLastNode(LinkedListNode head, int n) {// Replace this placeholder return statement with your codereturn head;}}