Linked List pattern

Remove Nth Node From End

Given the head of a singly linked list, remove the nth node counting from the end of the list and return the head of the modified list. Watch it run step by step, then write your own pseudocode and get it checked by AI.

  • LeetCode 19
  • Medium
  • 2 approaches
Sign in to open it See plans

Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.

Linked ListLeetCode 19

Medium

From the first idea to the best one

  1. 01 Brute force · two passes O(n) ×2O(1) space
  2. 02 Optimized · one pass, gap of n O(n)O(1) space
Each approach plays step by step, with its time and space.

What you will learn

  • How to read Remove Nth Node From End and spot the linked list pattern in it
  • Brute force · two passes: O(n) ×2 time, O(1) space
  • Optimized · one pass, gap of n: O(n) time, O(1) space
  • The pseudocode for each approach, its line lit as the animation runs
  • Practice: write your own pseudocode and get it checked

More Linked List

See Remove Nth Node From End run, step by step

Sign in and this page opens on the animation, with all 9 Linked List problems beside it.

Sign in to open itSee plans

DSA comes with the all labs plan and every ChaiCode batch.