classSolution{publicintlengthOfLongestSubstring(String s){Map<Character,Integer> map =newHashMap<>();int max =0, pre =-1;for(int i =0; i < s.length(); i++){char curr = s.charAt(i);if(map.containsKey(curr)){
pre =Math.max(pre, map.put(curr, i));}else{
map.put(curr, i);}
max =Math.max(max, i - pre);}return max;}}