🔥 Remove Nth Node From End of List

Author: maddhruv

README.md

@@ -33,3 +33,4 @@ Solutions of LeetCode Blind 75 Problems in JavaScript
 | [Linked List Cycle](./linked-list-cycle.js)                                       | <img src="https://img.shields.io/badge/-Easy-green" />    | `Linked List`, `Hash Table`, `Two Pointers`                  | [:link:](https://leetcode.com/problems/linked-list-cycle/)                    |
 | [Merge Two Sorted Lists](./merge-two-sorted-lists.js)                             | <img src="https://img.shields.io/badge/-Easy-green" />    | `Linked List`, `Recursion`                                   | [:link:](https://leetcode.com/problems/merge-two-sorted-lists/)               |
 | [Merge k Sorted Lists](./merge-k-sorted-lists.js)                                 | <img src="https://img.shields.io/badge/-Hard-red" />      | `Linked List`, `Recursion`, `Divide & Conquer`, `Merge Sort` | [:link:](https://leetcode.com/problems/merge-k-sorted-lists/)                 |
+| [Remove Nth Node From End of List](./remove-nth-node-from-end-of-list.js)         | <img src="https://img.shields.io/badge/-Medium-orange" /> | `LinkedList`, `Two Pointers`                                 | [:link:](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)     |

remove-nth-node-from-end-of-list.js

@@ -0,0 +1,18 @@
+const removeNthFromEnd = (head, n) => {
+  const newNode = new ListNode(0, head);
+  let left = newNode;
+  let right = head;
+
+  while (n) {
+    right = right.next;
+    n--;
+  }
+
+  while (right) {
+    left = left.next;
+    right = right.next;
+  }
+
+  left.next = left.next.next;
+  return newNode.next;
+};