-
Notifications
You must be signed in to change notification settings - Fork 0
/
SubstringLength.js
44 lines (35 loc) · 1014 Bytes
/
SubstringLength.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
/* Description :
Given a string s, find the length of the longest
substring , without repeating characters. */
/* Example 1:
Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.
Example 2:
Input: s = "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.
Example 3:
Input: s = "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3.
Notice that the answer must be a substring, "pwke" is a subsequence and not a substring. */
/* ---------------------------------------------------------------------------------------------------- */
var lengthOfLongestSubstring = (s) => {
let maxLen = 0 ;
let i = 0 ;
let j = 0 ;
const set = new Set()
while (j<s.length){
if(!set.has(s[j])){
set.add(s[j])
j++
maxLen = Math.max(maxLen,set.size)
}else{
set.delete(s[i])
i++
}
}
return maxLen
};
console.log(lengthOfLongestSubstring("abbc"))