Count non-repeated characters
Print how many characters appear exactly once in the string (upper and lower case count as different).
Reported in: Tech Mahindra (2024) (memory-based)
Input
One line: the string.
Output
The count.
Constraints
1 ≤ length ≤ 10^5.
Example 1
Input:
alphaadida
Output:
4Example 2
Input:
aabb
Output:
0Hint: Count every character, then count the ones with frequency 1.