class Solution {
public:
int lengthOfLongestSubstring(string s) {
unordered_map[HTML_REMOVED]hash;
int res=0;
for(int i=0,j=0;i[HTML_REMOVED]1) hash[s[j++]]–;
res=max(res,i-j+1);
}
return res;
}
};