Add solution #83

Author: JoshCrozier

README.md

@@ -35,6 +35,7 @@
 66|[Plus One](./0066-plus-one.js)|Easy|
 67|[Add Binary](./0067-add-binary.js)|Easy|
 73|[Set Matrix Zeroes](./0073-set-matrix-zeroes.js)|Medium|
+83|[Remove Duplicates from Sorted List](./0083-remove-duplicates-from-sorted-list.js)|Easy|
 88|[Merge Sorted Array](./0088-merge-sorted-array.js)|Easy|
 118|[Pascal's Triangle](./0118-pascals-triangle.js)|Easy|
 119|[Pascal's Triangle II](./0119-pascals-triangle-ii.js)|Easy|

solutions/0083-remove-duplicates-from-sorted-list.js

@@ -0,0 +1,38 @@
+/**
+ * 83. Remove Duplicates from Sorted List
+ * https://leetcode.com/problems/remove-duplicates-from-sorted-list/
+ * Difficulty: Easy
+ *
+ * Given the head of a sorted linked list, delete all duplicates such that each
+ * element appears only once. Return the linked list sorted as well.
+ */
+
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @return {ListNode}
+ */
+var deleteDuplicates = function(head) {
+  const result = new ListNode();
+  const set = new Set();
+  let tail = result;
+
+  while (head) {
+    if (!set.has(head.val)) {
+      tail.next = new ListNode(head.val);
+      tail = tail.next;
+    }
+
+    set.add(head.val);
+
+    head = head.next;
+  }
+
+  return result.next;
+};