longest_substring_wo_repeating_chars.txt

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