Answer2

Answer2.java

import java.util.HashMap;
import java.util.Map;

class Question2 {
    public static final int MAX_UNICODE = 65_535;

    public static void main(String[] args) {
        System.out.println(checkWhetherStringIsUnique("Competitive Programming"));
    }

    public static boolean checkWhetherStringIsUnique(String string) {
        Map<Character, Boolean> characters = new HashMap<>();
        Map<Character, Integer> frequency = new HashMap<>();
        char [] str = string.toCharArray();
        for(int i = 0; i < str.length; i++)
        {
            if(frequency.get(str[i]) == null)
            {
                frequency.put(str[i],1);
            }
            else
            {
                frequency.put(str[i],(frequency.get(str[i]) + 1));
            }
        }
        for(int i = 0; i < str.length;i++)
        {
            if(str[i] != ' ')
            {
                if(frequency.get(str[i]) != 1)
                {
                    characters.put(str[i],false);
                }
                else if(frequency.get(str[i]) == 1)
                {
                    characters.put(str[i],true);
                }
            }
        }
        for(int i = 0; i < str.length;i++)
        {
            if(characters.get(str[i]) == false)
            {
                return false;
            }
        }

        return true;
    }
}
// Aryan Dixit
// 191500156
// SECTION G
// 35