CareerCup

i didn't understand the problem can u please explain this problem in detail.

1. put the string in hashtable.
2. Compare the pangram starting from A till Z.
3. If the character is found in hashtable, move to next character. If not found, maintain another string of missing letters and put the missing character in this string.

Can u explain the question a little bit clear???pls..

Check wiki for 'Pangram'

Pangram string is missing some alphabets. Find them..

public String missingPangrams(String inputStr){
        StringBuilder str = new StringBuilder();
        char offset = 'a';
        BitSet b = new BitSet(26);
        b.set(0,25,false);
        if(inputStr != null && inputStr.isEmpty()) {
            inputStr = inputStr.toLowerCase();
            for (int i = 0; i < inputStr.length(); i++) {
                b.set(inputStr.charAt(i) - offset, true);
            }
        }

        for (int i = 0; i < 26; i++) {
            if(!b.get(i)) str.append((char)(offset + i));
        }
        return str.toString();

}

public String missingPangrams(String inputStr){
        StringBuilder str = new StringBuilder();
        char offset = 'a';
        BitSet b = new BitSet(26);
        b.set(0,25,false);
        if(inputStr != null && inputStr.isEmpty()) {
            inputStr = inputStr.toLowerCase();
            for (int i = 0; i < inputStr.length(); i++) {
                b.set(inputStr.charAt(i) - offset, true);
            }
        }

        for (int i = 0; i < 26; i++) {
            if(!b.get(i)) str.append((char)(offset + i));
        }
        return str.toString();

}

public String missingPangrams(String inputStr){
StringBuilder str = new StringBuilder();
char offset = 'a';
BitSet b = new BitSet(26);
b.set(0,25,false);
if(inputStr != null && inputStr.isEmpty()) {
inputStr = inputStr.toLowerCase();
for (int i = 0; i < inputStr.length(); i++) {
b.set(inputStr.charAt(i) - offset, true);
}
}

for (int i = 0; i < 26; i++) {
if(!b.get(i)) str.append((char)(offset + i));
}
return str.toString();
}

public String missingPangrams(String inputStr){
        StringBuilder str = new StringBuilder();
        char offset = 'a';
        BitSet b = new BitSet(26);
        b.set(0,25,false);
        if(inputStr != null && inputStr.isEmpty()) {
            inputStr = inputStr.toLowerCase();
            for (int i = 0; i < inputStr.length(); i++) {
                b.set(inputStr.charAt(i) - offset, true);
            }
        }

        for (int i = 0; i < 26; i++) {
            if(!b.get(i)) str.append((char)(offset + i));
        }
        return str.toString();
    }