Added Java solution to 'Remove Nth Node from End of List'

Author: anthonyzhub

Remove Nth Node From End of List.java

@@ -0,0 +1,46 @@
+// https://leetcode.com/problems/remove-nth-node-from-end-of-list/
+
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+
+ class Solution {
+    public ListNode removeNthFromEnd(ListNode head, int n) {
+
+        // If head is empty or by itself, return null
+        if (head == null || head.next == null) {
+            return null;
+        }
+        
+        // Create a dummy node to help return value
+        ListNode dummy = new ListNode();
+        dummy.next = head;
+
+        // Create a left and right node pointer
+        ListNode leftNode = dummy;
+        ListNode rightNode = head;
+
+        // Move rightNode n steps
+        for (int i = 0; i < n; i++) {
+            rightNode = rightNode.next;
+        }
+
+        // Iterate linked list until rightNode reaches end of list
+        while (rightNode != null) {
+            leftNode = leftNode.next;
+            rightNode = rightNode.next;
+        }
+
+        // Cut target node from linked list
+        leftNode.next = leftNode.next.next;
+
+        return dummy.next;
+    }
+}