import java.util.HashSet;
import java.util.Set;
public class WtcaE1 {
public int lengthOfLongestSubstring(String s) {
int len = s.length();
if (len <= 1) {
return len;
}
int maxLen = 1;
int left = 0;
int right = 0;
Set window = new HashSet<>();
while (right < len) {
while (window.contains(s.charAt(right))) {
window.remove(s.charAt(left));
left++;
}
maxLen = Math.max(maxLen, right - left + 1);
window.add(s.charAt(right));
right++;
}
return maxLen;
}
}



