Suppose we have a string s. We have to check whether the given string is isogram or not. The isogram is a string where the occurrence of each letter is exactly one.
So, if the input is like s = "education", then the output will be True because all characters in "education" occurs exactly once.
To solve this, we will follow these steps −
Let us see the following implementation to get better understanding −
def solve(word): char_list =  for char in word: if char.isalpha(): if char in char_list: return False char_list.append(char) return True s = "education" print(solve(s))