We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 1a4b697 commit bf225cfCopy full SHA for bf225cf
longest-substring-without-repeating-characters/Jeehay28.ts
@@ -0,0 +1,21 @@
1
+// TC: O(n)
2
+// SC: O(n)
3
+
4
+function lengthOfLongestSubstring(s: string): number {
5
+ let seen = new Map<string, number>();
6
+ let maxLength = 0;
7
+ let start = 0;
8
9
+ for (let end = 0; end < s.length; end++) {
10
+ const ch = s[end];
11
12
+ if (seen.has(ch) && seen.get(ch)! >= start) {
13
+ start = seen.get(ch)! + 1;
14
+ }
15
16
+ seen.set(ch, end);
17
+ maxLength = Math.max(maxLength, end - start + 1);
18
19
20
+ return maxLength;
21
+}
0 commit comments