diff --git a/Data Structures/LinkedList/Remove Nth Node From End of List.cpp b/Data Structures/LinkedList/Remove Nth Node From End of List.cpp
new file mode 100644
index 00000000..e88efe43
--- /dev/null
+++ b/Data Structures/LinkedList/Remove Nth Node From End of List.cpp	
@@ -0,0 +1,61 @@
+/*
+
+Remove Nth Node From End of List
+
+Given the head of a linked list, remove the nth node from the end of the list and return its head.
+
+
+Example 1:
+
+Input: head = [1,2,3,4,5], n = 2
+Output: [1,2,3,5]
+
+
+Example 2:
+
+Input: head = [1], n = 1
+Output: []
+
+
+Example 3:
+
+Input: head = [1,2], n = 1
+Output: [1]
+
+Constraints:
+
+The number of nodes in the list is sz.
+1 <= sz <= 30
+0 <= Node.val <= 100
+1 <= n <= sz
+
+https://leetcode.com/problems/remove-nth-node-from-end-of-list/
+
+*/
+
+  
+class Solution {
+public:
+    ListNode* removeNthFromEnd(ListNode* head, int n) {
+        
+        ListNode * dummy = new ListNode(0);
+        
+        dummy->next = head;
+        
+        ListNode * fast = dummy;
+        ListNode * slow = dummy;
+        
+        while(n>0){
+            n--;
+            fast = fast->next;
+        }
+        
+        while(fast!=NULL && fast->next!=NULL){
+            slow = slow->next;
+            fast = fast->next;
+        }
+        slow->next = slow->next->next;
+        
+        return dummy->next;
+    }
+};
\ No newline at end of file