Isograms

Description:

An isogram is a word that has no repeating letters, consecutive or non-consecutive. Implement a function that determines whether a string that contains only letters is an isogram. Assume the empty string is an isogram. Ignore letter case.

Example: (Input --> Output)

"Dermatoglyphics" --> true
"aba" --> false
"moOse" --> false (ignore letter case)

 

 

Solution:

1. Change all 'string' to lower case and set type.
2. Compares the length of the original 'string' and the set 'string' and returns a Boolean value.

 

def is_isogram(string):
    return len(set(string.lower())) == len(string)