Day 4: is_pangram i.e. string contains all alphabets

Author: AimenYaseen

daily_challenges/day_4/1_is_panagram.py

@@ -0,0 +1,26 @@
+"""
+Write a Python function to check whether a string is pangram or not.
+Assume the string passed in does not have any punctuation.
+
+Note:A pangram is a sentence containing every letter of the alphabet.
+Example:
+A quick brown fox jumps over the lazy dog.
+"""
+
+
+def is_pangram(input_str: str):
+    alphabets = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't',
+                 'u', 'v', 'w', 'x', 'y', 'z']
+    for item in input_str:
+        if item.lower() in alphabets:
+            alphabets.remove(item.lower())
+
+    if not alphabets:
+        return "It is a Panagram"
+    else:
+        return "It is not Panagram"
+
+
+string = "A quick brown fox jumps over the lazy dog."
+print(is_pangram(string))
+print(is_pangram("hashim"))

daily_challenges/day_4/2_another_approach.py

@@ -0,0 +1,28 @@
+import string
+
+
+def is_panagram(input_string):
+    alphabets = string.ascii_lowercase
+
+    for char in alphabets:
+        if char not in input_string.lower():
+            return "It is not Pangram"
+    return "It is Pangram"
+
+
+test = "A quick brown fox jumps over the lazy dog."
+print(is_panagram(test))
+print(is_panagram("hashim"))
+
+
+def is_pangram(_string):
+    _string = _string.lower()
+    # chr() convert digits from 97-123 to its ascii lower case character
+    charset = [chr(i) for i in range(97, 123)]
+    for char in charset:
+        if char not in _string:
+            return False
+    return True
+
+# Time Complexity - O(N)
+# Space Complexity - O(1)

daily_challenges/day_4/3_improved_approach.py

@@ -0,0 +1,26 @@
+import string
+
+
+def is_panagram(str1):
+    # Create a set of the alphabet of the string passed
+    alphabet = string.ascii_lowercase
+    alpha_set = set(alphabet)
+
+    # Remove spaces from str1
+    str1 = str1.replace(" ", '')
+
+    # Lowercase all strings and assigned back to string
+    # Recall we assume no punctuation
+    str1 = str1.lower()
+
+    # Grab all unique letters in the string as a set
+    str1 = set(str1)
+    print(str1)
+
+    # Now check that the alphabet set is same as string set
+    return str1 == alpha_set
+
+
+test = "A quick brown fox jumps over the lazy dog"
+print(is_panagram(test))
+print(is_panagram("hashim"))