✅ [83] NeetCode - but coded myself

Author: enkr1

83/o_solution.js

@@ -0,0 +1,50 @@
+class ListNode {
+  constructor(val, next) {
+    this.val = (val === undefined ? 0 : val);
+    this.next = (next === undefined ? null : next);
+  }
+}
+
+/**
+ * @param {ListNode} head
+ * @return {ListNode}
+ */
+const deleteDuplicates = (head) => {
+  let result = head;
+
+  while (head) {
+    let curr = head;
+    while (head.next && curr.val === head.next.val) {
+      head.next = head.next.next;
+    }
+    head = head.next;
+  }
+
+  console.log("result")
+  // console.log(result)
+  while (result) {
+    console.log(result.val)
+    result = result.next;
+  }
+
+  return result;
+}
+
+deleteDuplicates(
+  new ListNode(1,
+    new ListNode(1,
+      new ListNode(1,
+        new ListNode(2,
+          new ListNode(2,
+            new ListNode(2,
+              new ListNode(3,
+                new ListNode(3
+                )
+              )
+            )
+          )
+        )
+      )
+    )
+  )
+)

83/solution.js

@@ -9,7 +9,7 @@ class ListNode {
  * @param {ListNode} head
  * @return {ListNode}
  */
-const deleteDuplicates = (head) => {
+const deleteDuplicates1 = (head) => {
   let map = new Map(), dummy = new ListNode(), result = dummy;
 
   while (head) {
@@ -24,3 +24,17 @@ const deleteDuplicates = (head) => {
 
   return result.next;
 }
+
+const deleteDuplicates = (head) => {
+  let result = head;
+
+  while (head) {
+    let curr = head;
+    while (head.next && curr.val === head.next.val) {
+      head.next = head.next.next;
+    }
+    head = head.next;
+  }
+
+  return result;
+}