Saved Text Snippet

class Solution { public int numberOfSpecialChars(String word) { Boolean[] lower = new Boolean[26]; Boolean[] upper = new Boolean[26]; for(int i = 0 ; i < 26; i++) { lower[i] = false; upper[i] = false; } for(char ch : word.toCharArray()) { if(Character.isLowerCase(ch)) { char UpperCaseCh = Character.toUpperCase(ch); if(upper[UpperCaseCh - 'A'] != null && upper[UpperCaseCh - 'A'].booleanValue() == true) { lower[ch-'a'] = false; } else { lower[ch - 'a'] = true; } } else { char lowerCaseCh = Character.toLowerCase(ch); if(lower[lowerCaseCh - 'a'] != null && lower[lowerCaseCh - 'a'].booleanValue() == true) { upper[ch - 'A'] = null; } else { upper[ch - 'A'] = false; } } } int count = 0; for(int i = 0; i < 26; i++) { // if(upper[i] == null) continue; if(lower[i] != null && upper[i] != null && upper[i].booleanValue() == true && lower[i].booleanValue() == true) { count++; System.out.println(i); } } return count; } }