Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Go

Remove Nth Node from End of List

Explore how to remove the nth node from the end of a singly linked list in a single traversal using the two pointers technique. Understand the essential approach to efficiently modify linked lists and develop problem-solving skills for coding interviews.

We'll cover the following...

Statement

Given the head of a singly linked list, remove the nthn^{th} node from the end of the list and return the head of the modified list.

Note: Could you solve this in a single pass through the list?

Constraints:

  • The number of nodes in the list is sz

  • 1≤1 \leq sz ≤30\leq 30

  • 0≤0 \leq Node.val ≤100\leq 100

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

Examples

canvasAnimation-image
1 / 6

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.

Given the linked list 42 → 88 → 15 and n = 2, what is the resulting linked list after removing the nth node from the end?

A.

[42, 15]

B.

[42, 88]

C.

[88, 15]

D.

[42, 88, 15]

1 / 5

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

Try it yourself

Implement your solution in the following coding playground.

Need a nudge?

Explore these hints—each one is designed to guide you a step closer to the solution.

Go
usercode > Solution.go
// Definition for a Linked List node



// type ListNode struct {

// 	Val  int

// 	Next *ListNode

// }



package main

import (. "golang-test-code/ds_v1/LinkedList")



func removeNthLastNode(head *ListNode, n int) *ListNode {

	

	// Replace this placeholder return statement with your code

	

	return new(ListNode)

}
Remove Nth Node from End of List