Add solution #203

Author: JoshCrozier

README.md

@@ -46,6 +46,7 @@
 141|[Linked List Cycle](./0141-linked-list-cycle.js)|Easy|
 151|[Reverse Words in a String](./0151-reverse-words-in-a-string.js)|Medium|
 152|[Maximum Product Subarray](./0152-maximum-product-subarray.js)|Medium|
+203|[Remove Linked List Elements](./0203-remove-linked-list-elements.js)|Easy|
 217|[Contains Duplicate](./0217-contains-duplicate.js)|Easy|
 219|[Contains Duplicate II](./0219-contains-duplicate-ii.js)|Easy|
 226|[Invert Binary Tree](./0226-invert-binary-tree.js)|Easy|

solutions/0203-remove-linked-list-elements.js

@@ -0,0 +1,27 @@
+/**
+ * 203. Remove Linked List Elements
+ * https://leetcode.com/problems/remove-linked-list-elements/
+ * Difficulty: Easy
+ *
+ * Given the head of a linked list and an integer val, remove all the
+ * nodes of the linked list that has Node.val == val, and return the
+ * new head.
+ */
+
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @param {number} val
+ * @return {ListNode}
+ */
+var removeElements = function(head, val) {
+  if (!head) return null;
+  head.next = removeElements(head.next, val);
+  return head.val === val ? head.next : head;
+};