js-concepts: leetcode prob.3 - longest substring without repeated character

Author: baochau.dinh

LeetCode/3. Longest Substring Without Repeating Characters/index.js

@@ -0,0 +1,20 @@
+var lengthOfLongestSubstring = function(s) {
+  if (s.length <= 1) return s.length;
+  let maxCount = 0;
+  let i = 0, j = 0;
+  let uniqueSet = new Set();
+  while (i < s.length && j < s.length) {
+      if (!uniqueSet.has(s[j])) {
+          uniqueSet.add(s[j]);
+          maxCount = Math.max(maxCount, j - i + 1);
+          j++;
+      } else {
+          uniqueSet.delete(s[i]);
+          i++;
+      }
+  }
+  
+  return maxCount;
+};
+
+console.log(lengthOfLongestSubstring('abcabcbb'));