Remove Nth node from the end of list

Beginner Level 📁/Remove Nth node from end of list/Remove Nth node from the end.cpp

@@ -0,0 +1,83 @@
+#include <iostream>
+using namespace std;
+
+struct ListNode {
+    int val;
+    ListNode *next;
+    ListNode() : val(0), next(nullptr) {}
+    ListNode(int x) : val(x), next(nullptr) {}
+    ListNode(int x, ListNode *next) : val(x), next(next) {}
+};
+
+class Solution {
+public:
+    ListNode* removeNthFromEnd(ListNode* head, int n) {
+        if (head == nullptr) {
+            return head;
+        }
+        ListNode* dummy = new ListNode(0, head);
+        ListNode* first = dummy;
+        ListNode* second = dummy;
+
+        for (int i = 0; i <= n; i++) {
+            first = first->next;
+        }
+
+        while (first != nullptr) {
+            first = first->next;
+            second = second->next;
+        }
+
+        ListNode* nodeToDelete = second->next;
+        second->next = nodeToDelete->next;
+        delete nodeToDelete;
+
+        ListNode* newHead = dummy->next;
+        delete dummy;
+        return newHead;
+    }
+};
+
+void printList(ListNode* head) {
+    ListNode* current = head;
+    while (current != nullptr) {
+        cout << current->val << " -> ";
+        current = current->next;
+    }
+    cout << "nullptr" << endl;
+}
+
+ListNode* createList(int arr[], int size) {
+    if (size == 0) return nullptr;
+    ListNode* head = new ListNode(arr[0]);
+    ListNode* current = head;
+    for (int i = 1; i < size; i++) {
+        current->next = new ListNode(arr[i]);
+        current = current->next;
+    }
+    return head;
+}
+
+int main() {
+    int arr[] = {1, 2, 3, 4, 5};
+    ListNode* head = createList(arr, 5);
+
+    cout << "Original List: ";
+    printList(head);
+
+    Solution solution;
+    int n = 2;
+    head = solution.removeNthFromEnd(head, n);
+
+    cout << "List after removing " << n << "th node from the end: ";
+    printList(head);
+
+    ListNode* temp;
+    while (head != nullptr) {
+        temp = head;
+        head = head->next;
+        delete temp;
+    }
+
+    return 0;
+}

Beginner Level 📁/Remove Nth node from end of list/question.md

@@ -0,0 +1,4 @@
+Given the head of a linked list, remove the nth node from the end of the list and return its head.
+
+Input: head = [1,2,3,4,5], n = 2
+Output: [1,2,3,5]

Beginner Level 📁/data.json

@@ -145,6 +145,9 @@
     "name": "Vimal M",
     "githubUsername": "vimall03"
   },
-
+  {
+    "name": "Pranav Malhotra",
+    "githubUsername": "Pranav-malhotra"
+  },
 ]