@@ -0,0 +1,1445 @@
+import java.util.ArrayList;%0Aimport java.util.HashSet;%0Aimport java.util.List;%0Aimport java.util.Set;%0A%0Aclass IsUnique %7B%0A  public static void main(String%5B%5D args) %7B%0A    System.out.println(new IsUnique().isUniqueHashSet(%22asdfasdfasd%22));%0A    System.out.println(new IsUnique().isUniqueHashSet(%22abc%22));%0A    System.out.println(new IsUnique().isUniqueHash(%22asdfasdfasd%22));%0A    System.out.println(new IsUnique().isUniqueHash(%22abc%22));%0A    System.out.println(new IsUnique().isUniqueBitVector(%22asdfasdfasd%22));%0A    System.out.println(new IsUnique().isUniqueBitVector(%22abc%22));%0A  %7D%0A%0A  // Use the methods in HashSet%0A  public boolean isUniqueHashSet(String s) %7B%0A    Set%3CCharacter%3E list = new HashSet%3C%3E();%0A    for (int i = 0; i %3C s.length(); i++) %7B%0A      if (list.contains(s.charAt(i))) %7B%0A        return false;%0A      %7D else %7B%0A        list.add(s.charAt(i));%0A      %7D%0A    %7D%0A    return true;%0A  %7D%0A%0A  // The uniqueness of the Hash%0A  public boolean isUniqueHash(String s) %7B%0A    Set%3CCharacter%3E set = new HashSet%3C%3E();%0A    for (int i = 0; i %3C s.length(); i++) %7B%0A      set.add(s.charAt(i));%0A    %7D%0A    return set.size() == s.length();%0A  %7D%0A%0A  // Bit vector?%0A  public boolean isUnique(String s) %7B%0A    if (s.length() %3E 128) return false;%0A%0A    boolean%5B%5D charSet = new boolean%5B128%5D;%0A    for (int i = 0; i %3C s.length(); i++) %7B%0A      int val = s.charAt(i);%0A      if (charSet%5Bval%5D) %7B%0A        return false;%0A      %7D else %7B%0A        charSet%5Bval%5D = true;%0A      %7D%0A    %7D%0A    return true;%0A  %7D%0A%7D

Add solution 1.1 Java