Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Uncategorized category for The Most Wanted Letter by MartynaDziubalka
from operator import itemgetter
def checkio(text):
text = text.lower()
trimmed_text = ''.join(e for e in text if e.isalpha()) # usuwa wszystkie znaki specjalne
unique_sorted_text = sorted(set(trimmed_text)) #set towrzy unikatowy zbiór a sorted sortuje je alfabetycznie
dictionary = [] # [litera, liczba_wystąpień]
for x in unique_sorted_text: dictionary.append([x, trimmed_text.count(x)]) # oblicza liczbe wystąpień dla każdej literki
most_common = max(dictionary, key=itemgetter(1))[0] #wyszukuje maksymalną wartość klucza który pobierany jest przez itemgetter(1)
return most_common
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert checkio("Hello World!") == "l", "Hello test"
assert checkio("How do you do?") == "o", "O is most wanted"
assert checkio("One") == "e", "All letter only once."
assert checkio("Oops!") == "o", "Don't forget about lower case."
assert checkio("AAaooo!!!!") == "a", "Only letters."
assert checkio("abe") == "a", "The First."
assert checkio("Lorem ipsum dolor sit amet 0000000000000000000") == "m", "lorem psum"
print("Start the long test")
assert checkio("a" * 9000 + "b" * 1000) == "a", "Long."
print("The local tests are done.")
Jan. 21, 2016
