Create README - LeetHub

Author: hajin-kim

0019-remove-nth-node-from-end-of-list/README.md

@@ -0,0 +1,36 @@
+<h2><a href="https://leetcode.com/problems/remove-nth-node-from-end-of-list/">19. Remove Nth Node From End of Lista>h2><h3>Mediumh3><hr><p>Given the <code>headcode> of a linked list, remove the <code>n<sup>thsup>code> node from the end of the list and return its head.p>
+
+<p>&nbsp;p>
+<p><strong class="example">Example 1:strong>p>
+<img alt="" src="https://assets.leetcode.com/uploads/2020/10/03/remove_ex1.jpg" style="width: 542px; height: 222px;" />
+<pre>
+<strong>Input:strong> head = [1,2,3,4,5], n = 2
+<strong>Output:strong> [1,2,3,5]
+pre>
+
+<p><strong class="example">Example 2:strong>p>
+
+<pre>
+<strong>Input:strong> head = [1], n = 1
+<strong>Output:strong> []
+pre>
+
+<p><strong class="example">Example 3:strong>p>
+
+<pre>
+<strong>Input:strong> head = [1,2], n = 1
+<strong>Output:strong> [1]
+pre>
+
+<p>&nbsp;p>
+<p><strong>Constraints:strong>p>
+
+<ul>
+	The number of nodes in the list is sz.
+	1 <= sz <= 30
+	0 <= Node.val <= 100
+	1 <= n <= sz
+ul>
+
+<p>&nbsp;p>
+<p><strong>Follow up:strong> Could you do this in one pass?p>