Count Letters

[oldoc63]

We are going to count the number of unique letters in a string. This mean that when we are looking at the word, any new letters should be counted and any duplicates should not be counted. We need to:

1. Define the function to accept one parameter -the word whose letters we are counting
2. Create a counter to keep track of unique letters
3. Loop through every letter in our alphabet string. If the current letter was found in our word, increase our count
4. Return the count after looping through all letters.

[oldoc63]

Write a function called unique_english_letters that takes the string word as a parameter. The function should return the total number of unique letters in the string. Uppercase and lowercase letters should be counted as different letters. We've given you a list of every uppercase and lowercase letter in the English alphabet. It would be useful to include this list in your function.

[oldoc63]

Since the provided alphabet string includes a single instance of all uppercase and lowercase letters in the English alphabet, we can iterate through that string and see if our input strings contains the current letter we are looking at. This can be accomplished using the keyword in. For every letter in the possible letters, we see if that letter is in our string.