We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent ef7360d commit 6f93310Copy full SHA for 6f93310
Isograms/isograms.py
@@ -0,0 +1,12 @@
1
+def is_isogram(string):
2
+ lower_string = string.lower()
3
+ unique_string = set(lower_string)
4
+ return (len(lower_string)==len(unique_string))
5
+
6
+def main():
7
+ print(is_isogram("Dermatoglyphics"))
8
+ print(is_isogram("aba"))
9
+ print(is_isogram("moOse"))
10
+ print(is_isogram(""))
11
12
+main()
Isograms/problem_statement.txt
@@ -0,0 +1,7 @@
+An isogram is a word that has no repeating letters, consecutive or non-consecutive.
+How to determine whether a string is an isogram. Ignore letter case
+Ex.
+"Dermatoglyphics" is isogram.
+"aba" is not isogram.
+"moOse" is not isogram.
0 commit comments