3. Longest Substring Without Repeating Characters

• Question Description
  
• My Key

package Three_LongestSubstring;
import java.util.HashSet;
import java.util.Set;
public class LongestSubstring_key {
      public static void main(String[] args) {
            System.out.println(lengthOfLongestSubstring("abcdabcd"));
      }
      
      public static int lengthOfLongestSubstring(String s) {
            int n = s.length();
            
            int ans = 0;
            
            for (int i = 0; i < n; i++)
                  for (int j = i+1; j <= n; j++)
                        if(allUnique(s, i, j)) ans = Math.max(ans, j-i);
            
            return ans;
      }
      
      public static boolean allUnique(String s, int start, int end) {
            Set<Character> set = new HashSet<>();
            for (int i = start; i < end; i++) {
                  Character ch = s.charAt(i);
                  
                  if (set.contains(ch)) return false;
                  set.add(ch);                  
            }
            return true;
      }
}