3120. Count the Number of Special Characters I

Solved
Easy
Companies
Hint
You are given a string word. A letter is called special if it appears both in lowercase and uppercase in word. the number of special letters in word.

Example 1:

Input: word = “aaAbcBC”

Output: 3

Explanation:

The special characters in word are ‘a’, ‘b’, and ‘c’.

Example 2:

Input: word = “abc”

Output: 0

Explanation:

No character in word appears in uppercase.

Example 3:

Input: word = “abBCab”

Output: 1

Explanation:

The only special character in word is ‘b’.

Constraints:

1 <= word.length <= 50
word consists of only lowercase and uppercase English letters.

class Solution {
    public int numberOfSpecialChars(String word) {
        int[] chArr=new int[256];
        for(char ch: word.toCharArray()) chArr[ch]++;
        int c=0;
        for(int i=0;i<256-32;i++) if(chArr[i]!=0 && chArr[i+32]!=0) c++;
        return c;
    }
}

/**
3120. Count the Number of Special Characters I
Solved
Easy
Companies
Hint
You are given a string word. A letter is called special if it appears both in lowercase and uppercase in word.

Return the number of special letters in word.

 

Example 1:

Input: word = "aaAbcBC"

Output: 3

Explanation:

The special characters in word are 'a', 'b', and 'c'.

Example 2:

Input: word = "abc"

Output: 0

Explanation:

No character in word appears in uppercase.

Example 3:

Input: word = "abBCab"

Output: 1

Explanation:

The only special character in word is 'b'.

 

Constraints:

1 <= word.length <= 50
word consists of only lowercase and uppercase English letters.
 */