The End of Other The End of Other
Elementary
English EL FR HU JA RU UK
horse

For language training our Robots want to learn about suffixes.

In this task, you are given a set of words in lower case. Check whether there is a pair of words, such that one word is the end of another (a suffix of another). For example: {"hi", "hello", "lo"} --...

Words as a set of strings.

True or False, as a boolean.

checkio({"hello", "lo", "he"}) == True
checkio({"hello", "la", "hellow", "cow"}) == False
checkio({"walk", "duckwalk"}) == True
checkio({"one"}) == False
checkio({"helicopter", "li", "he"}) == False
    

Here you can learn about iterating through set type and string data type functions.

2 ≤ len(words) < 30
all(re.match(r"\A[a-z]{1,99}\Z", w) for w in words)

You should be an authorized user in order to see the full description and start solving this mission.