Distinct letters
Statement
Goal
Given a word W containing only uppercase and lowercase letters, return the number of distinct letters (regardless of a case) in W.Input
A word W containing only uppercase and lowercase letters.
Output
A single line containing the integer N which is the number of distinct letters appearing in W.
Constraints
1 ≤ length of W ≤ 100
Example
Input
abc
Output
3
Game modes
Fastest, Shortest
Test cases
Distinct letters Test
Input
abc
Output
3
Validator 1 Validator
Input
abcdefghijklmnopqrstuvwxyz
Output
26
Repeated letters Test
Input
abcabc
Output
3
Validator 2 Validator
Input
abcdefgabcdefghijklmnopqrstuvwxyzhijklmnabcdefghijklmnopqrstuvwxyzopqrstuvwxyz
Output
26
Uppercase letters Test
Input
QWEWRTTTTYQQQE
Output
6
Validator 3 Validator
Input
QQQWWWWOOOUYETWRQEQPQOIUYQEWRWTEYRUTIQPQOWIEURYTRQEQPWOWIEYTQTWRQWUQWQOETEQERQQWYQWOQWRWUPPQOWQIWYEQ
Output
10
Mixed case Test
Input
ZabCd
Output
5
Validator 4 Validator
Input
asQWdsWEWadWQEEffRRR
Output
8
Overlapping mixed case Test
Input
abBA
Output
2
Validator 5 Validator
Input
nmBBMzxZZcVVVmmcN
Output
7
Solution language
Solution
Stub generator input