New problem done

problems/83/main.js

@@ -0,0 +1,40 @@
+/**
+ * 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) {
+  let prev = null;
+  let current = head;
+  let found = {};
+  while (current != null) {
+     if (current.val in found) {
+         prev.next = current.next;
+         current = current.next;
+     } else {
+         found[current.val] = true;
+         prev = current;
+         current = current.next;
+     }
+  }
+  return head;
+};
+
+const printLinkedList = (ll) => {
+    while (ll != null) {
+       console.log(ll.val);
+       ll = ll.next;
+    }
+};
+
+console.log("Expected: 1->2");
+let ll = new ListNode(1, new ListNode(1, new ListNode(2)));
+console.log(`Got:`);
+printLinkedList(deleteDuplicates(ll));

problems/83/problem.txt

@@ -0,0 +1,13 @@
+Given a sorted linked list, delete all duplicates such that each element appear only once.
+
+Example 1:
+
+Input: 1->1->2
+Output: 1->2
+
+Example 2:
+
+Input: 1->1->2->3->3
+Output: 1->2->3
+
+

problems/83/run.sh

@@ -0,0 +1,3 @@
+#!/bin/bash
+
+node main.js