Add week 7 solutions: longest-substring-without-repeating-characters

Author: gitsunmin

longest-substring-without-repeating-characters/gitsunmin.ts

@@ -0,0 +1,26 @@
+/**
+ * https://leetcode.com/problems/longest-substring-without-repeating-characters/
+ * time complexity : O(n)
+ * space complexity : O(n)
+ */
+function lengthOfLongestSubstring(s: string): number {
+    let n = s.length, ans = 0;
+    const map = new Map<string, number>();
+    for (let j = 0, i = 0; j < n; j++) {
+        if (map.has(s[j])) {
+            i = Math.max((map.get(s[j]) ?? 0) + 1, i);
+        }
+        ans = Math.max(ans, j - i + 1);
+        map.set(s[j], j);
+    }
+    console.log('map:', map);
+    return ans;
+};
+
+const testInput1 = "abcabcbb";
+const testInput2 = "bbbbb";
+const testInput3 = "pwwkew";
+
+console.log('output1:', lengthOfLongestSubstring(testInput1), 'expected:', 3);
+console.log('output2:', lengthOfLongestSubstring(testInput2), 'expected:', 1);
+console.log('output3:', lengthOfLongestSubstring(testInput3), 'expected:', 3);