class Solution {
public int lengthOfLongestSubstring(String s) {
int left=0,right=0,result=0;
HashSet<Character> set=new HashSet<Character>();
while(right<s.length()){
if(!set.contains(s.charAt(right))){
set.add(s.charAt(right++));
result=Math.max(result,set.size());
}
else{
set.remove(s.charAt(left++));
}
}
return result;
}
}