@@ -0,0 +1,855 @@
+%0A%0A/* Implement an algorithm to determine if a string has all unique characters. %0AWhat if you cannot use additional data structures? */%0A%0Apublic class UniqueChar %7B%0A    %0A    // always added for testing the solution%0A    public static void main (String%5B%5D args) %7B%0A        %0A        System.out.println(%22I am unique :%22 + isUniqueChars(%22I am unique%22));%0A        System.out.println(%22I am uniqe :%22 + isUniqueChars(%22I am uniqe%22));%0A    %7D%0A    %0A    %0A    public static boolean isUniqueChars(String str) %7B%0A        %0A        if (str.length() %3E 256) return false; %0A        %0A        boolean%5B%5D char_set = new boolean%5B256%5D;%0A        for (int i = 0; i %3C str.length(); i++) %7B%0A            int val = str.charAt(i);%0A            if (char_set%5Bval%5D) %7B%0A                return false;%0A            %7D%0A            %0A            char_set%5Bval%5D = true;%0A        %7D%0A      return true;%0A        %0A    %7D%0A%0A%7D

add array solution