✨ [128] MY ATTEMPT!! PASSED!

Author: enkr1

128/my_solution.js

@@ -3,28 +3,29 @@
  * @return {number}
  */
 const longestConsecutive = (nums) => {
-  let set = new Set();
+  let set = new Set(), maxCount = 0;
 
   for (let i = 0; i < nums.length; i++) {
     set.add(nums[i]);
   }
 
-  let maxCount = 0, sequenceMap = new Map();
   for (let val of set) {
     console.log(`val:${val}`)
     // NOTE: Only get the start of a sequence
     if (!set.has(val - 1)) {
-      let nextVal = val + 0; // curr / next
-      while (set.has(nextVal)) {
-        sequenceMap.set(val, (sequenceMap.get(val) || 0) + 1);
-        maxCount = Math.max(sequenceMap.get(val), maxCount);
-        nextVal++;
+      console.log("this does not have a before - is a head")
+
+      // curr / next
+      let expand = 0;
+      while (set.has(val + expand)) {
+        expand++;
       }
+
+      maxCount = Math.max(expand, maxCount);
     }
   }
 
   console.log(set)
-  console.log(sequenceMap)
   return maxCount;
 };
 

128/solution.js

@@ -0,0 +1,23 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+const longestConsecutive = (nums) => {
+  let set = new Set(), maxCount = 0;
+
+  for (let i = 0; i < nums.length; i++) {
+    set.add(nums[i]);
+  }
+
+  for (let val of set) {
+    if (!set.has(val - 1)) {
+      let expand = 0;
+      while (set.has(val + expand)) {
+        expand++;
+      }
+      maxCount = Math.max(expand, maxCount);
+    }
+  }
+
+  return maxCount;
+};