String Comparing

[Donovan]

Do you have an algorithm for doing this? What does it mean to be a "common letter"? What does it mean to be a "unique letter"? If I you write two words on a page how would you determine if the first letter in the first word is common or unique? Once you have the algorithm figured out it should be simple to translate that to Python.

@deanhystad, I think this is a valid question. Here is what I think the original poster is meaning to do when comparing the common and unique letters in each string.

string_1 = "Some String"
string_2 = "Something Stringy"
string_3 = "String Cheese"

In my opinion, they are either comparing vowels to consonants or they are comparing and contrasting each letter in each string to see how many times they are referenced. That way they find the most common and least commonly referenced letters in the string.

In this example we have the following letters: E, I, O, Y (Vowels) S, M, T, H, R, N, G (Consonants)

The program would then count the index values and compare it against other string values. I would write the code example if I could but I am not yet that good, still learning :)