add some type hints

Author: masterpol

anagram.py

@@ -6,7 +6,7 @@
 Write a function called is_anagram that takes in two strings as input and returns True if the two strings are anagrams of each other, and False otherwise. The function should be case-insensitive and should ignore spaces.
 """
 
-def is_anagram(str1, str2):
+def is_anagram(str1: str, str2: str) -> bool:
     first_list = list(str1.lower().replace(" ", ""))
     second_list = list(str2.lower().replace(" ", ""))
 

domain-hits.py

@@ -1,3 +1,4 @@
+from typing import Union, List
 '''
  for a set of elements in an array with the shape [10, "google.com"]
  being the first element the number of hit for the second the domain
@@ -14,16 +15,16 @@
  ]
 '''
 
-Domain = list[int, str]
+Domain = List[Union[int, str]]
 Result = dict[str, int]
 
-data: [Domain] = [
+data: List[Domain] = [
     [10, "jsfiddle.com"],
     [20, "maps.google.com"],
     [30, "photos.google.com"]
 ] 
 
-def getDicFromList(input: [Domain]) -> Result:
+def getDicFromList(input: List[Domain]) -> Result:
     return { key: value for [value, key] in input }
 
 def getSubDomainsRecursively(input: list[str], acc: Result, ref: Result) -> Result: 
@@ -51,7 +52,7 @@ def main():
     obj = getDicFromList(data)
     result: Result;
 
-    for k, v in obj.items():
+    for k in obj.items():
         subDomains = k.split('.')
         result = getSubDomainsRecursively(subDomains[1:len(subDomains)], obj, obj)
 

longest-substring.py

@@ -6,8 +6,6 @@
 Write a function called length_of_longest_substring that takes a string s as input and returns an integer representing the
 length of the longest substring without repeating characters
 """
-from functools import reduce
-
 def length_of_longest_substring(s: str) -> int:
     longest = 0
     current = ""

word-frequency.py

@@ -7,6 +7,7 @@
 """
 
 import re
+from typing import List
 song = """
 We're no strangers to love
 You know the rules and so do I (do I)
@@ -64,24 +65,24 @@
 Never gonna tell a lie and hurt you
 """
 
-def clean_sp_char(text):
+def clean_sp_char(text: str):
     return re.sub(r"[!@#$%^?/,()!&*]", "",text)
 
-def create_freq(text):
+def create_freq(text: str):
     words = []
     words = text.lower().split()
     wfreq= [words.count(w) for w in words]
     return list(zip(words,wfreq))[:]
 
-def filter_for_freq(input):
+def filter_for_freq(input: List) -> List:
     filtered = filter(lambda freq: freq[1] > 1, input)
     return list(set(filtered))[:]
 
-def print_result(input):
+def print_result(input: List) -> None:
     for freq in input:
         print(f"word: {freq[0]} count: {freq[1]}")
 
-def return_result_list(input):
+def return_result_list(input: str):
     cleanSong = clean_sp_char(input)
     listOfWords = filter_for_freq(create_freq(cleanSong))
     listOfWords.sort(key=lambda freq: freq[1], reverse=True)